Theoretical Computer Science Stack Exchange

-2

votes

1

answer

102

views

Language in $PSPACE$ and not necessarily in $P$ if $P=PP$?

cc.complexity-theory complexity-classes counting-complexity

modified 22 hours ago Lieuwe Vinkhuijzen 1,000

2

votes

0

answers

56

views

$XP_{\text{uniform}}=FPT$ and update to $EPTAS$ section in complexity zoo?

cc.complexity-theory reference-request complexity-classes approximation-algorithms parameterized-complexity

modified May 22 at 15:57 Martin Berger 9,335

2

votes

0

answers

132

views

Is the following problem in $coNP$?

cc.complexity-theory complexity-classes np convex-geometry determinant

modified May 21 at 17:39 Turbo 5,090

17

votes

4

answers

2k

views

Is there a natural problem in quasi-polynomial time, but not in polynomial time?

cc.complexity-theory complexity-classes np-complete polynomial-time np-intermediate

modified Apr 26 at 7:46 Jan Johannsen 3,894

6

votes

1

answer

150

views

Is there a relation between BBH (black box hypothesis) and SETH (strong exponential time hypothesis)?

complexity-classes time-complexity p-vs-np

answered Apr 20 at 20:35 Ryan Williams 23k

3

votes

1

answer

160

views

String theory based computations

complexity-classes quantum-computing

answered Apr 12 at 11:19 Peter Shor 21.2k

5

votes

1

answer

332

views

Indications that strengthen the conjecture: NEXP ⊊ EXP^NP

complexity-classes oracles nexp

modified Apr 10 at 9:01 Community♦ 1

37

votes

7

answers

6k

views

What do we know about provably correct programs?

reference-request complexity-classes computability pl.programming-languages

modified Apr 4 at 7:04 n.gaurav 3

9

votes

1

answer

486

views

2-NEXPTIME-complete problems

complexity-classes time-complexity complexity

modified Apr 2 at 15:02 Corto 1

1

vote

0

answers

112

views

Canonical complete problem for $\mathrm{FP}^{\Sigma^p_2}$

cc.complexity-theory complexity-classes polynomial-hierarchy

modified Apr 1 at 15:41 mnajib 6

8

votes

0

answers

104

views

Can we define a meaningful concept of exptime reductions (as opposed to polytime reductions) for classes like NEXP or NEEXP?

cc.complexity-theory complexity-classes reductions unary-languages

modified Mar 20 at 11:36 user138901 105

11

votes

0

answers

176

views

Computational Complexity of the Frobenius Problem

cc.complexity-theory ds.algorithms complexity-classes

modified Mar 8 at 16:28 Marzio De Biasi 18.7k

6

votes

1

answer

228

views

Example problem that is not in $2^{o(n)}$ but could be solved in $O(2^{cn})$ for any $c > 0$ (suggested by wording of ETH)

cc.complexity-theory ds.algorithms complexity-classes time-complexity sat

answered Feb 26 at 1:14 Dmytro Taranovsky 1,467

6

votes

2

answers

773

views

Isn't it trivial to represent any classical physics problem in a Spin-Glass language which is NP-Complete?

complexity-classes reductions np-complete physics statistical-physics

modified Feb 5 at 7:38 0x90 216

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Language in $PSPACE$ and not necessarily in $P$ if $P=PP$?

$XP_{\text{uniform}}=FPT$ and update to $EPTAS$ section in complexity zoo?

Is the following problem in $coNP$?

Is there a natural problem in quasi-polynomial time, but not in polynomial time?

Is there a relation between BBH (black box hypothesis) and SETH (strong exponential time hypothesis)?

String theory based computations

Indications that strengthen the conjecture: NEXP ⊊ EXP^NP

What do we know about provably correct programs?

2-NEXPTIME-complete problems

Canonical complete problem for $\mathrm{FP}^{\Sigma^p_2}$

Can we define a meaningful concept of exptime reductions (as opposed to polytime reductions) for classes like NEXP or NEEXP?

Computational Complexity of the Frobenius Problem

Example problem that is not in $2^{o(n)}$ but could be solved in $O(2^{cn})$ for any $c > 0$ (suggested by wording of ETH)

Isn't it trivial to represent any classical physics problem in a Spin-Glass language which is NP-Complete?

Hot Network Questions