Tag: complexity-classes

Found 280 results for 'complexity-classes'.

1) complexity-classes - Complexity of reachability in directed rooted forests
2) cc.complexity-theory - #P-complete problems are at least as hard as NP-complete problems
3) cc.complexity-theory - Hardness of approximation - additive error
4) complexity-classes - Looking for approximation class between NPO and Exp-APX
5) cc.complexity-theory - Examples where the uniqueness of the solution makes it easier to find
6) cc.complexity-theory - Complexity of modal logic IK5
7) cc.complexity-theory - Reducing P vs. NP to SAT
8) cc.complexity-theory - Ladner's Theorem vs. Schaefer's Theorem
9) cc.complexity-theory - Weighted cycles in weighted line graphs
10) cc.complexity-theory - On the class of the FNP version of the Hamiltonian Cycle problem
11) cc.complexity-theory - If only pathological cases of NP-hard problems are difficult to solve, then why isn't NP-hard defined to only include those pathological cases?
12) cc.complexity-theory - Consequences of $SAT \in BQP$
13) cc.complexity-theory - Problems outside of P that are not P-hard
14) cc.complexity-theory - Is there an assumption that implies $P=ZPP$ which is not known to imply $P=BPP$?
15) cc.complexity-theory - Is NP in $DTIME(n^{poly\log n})$?
16) cc.complexity-theory - Is semantic language complexity class UP Turing equivalent to syntactic language complexity class US?
17) cc.complexity-theory - Is P equal to the intersection of all superpolynomial time classes?
18) np-hardness - Complexity class of a subset problem similar to subset sum
19) cc.complexity-theory - How powerful are nondeterministic constant-depth circuits?
20) cc.complexity-theory - Two Variants of NP
21) cc.complexity-theory - Optimization problems with good characterization, but no polynomial-time algorithm
22) cc.complexity-theory - What is wrong with this $\mathsf{L} \subseteq \mathsf{L}-$uniform $\mathsf{NC}^1$ argument?
23) cc.complexity-theory - LogDCFL-complete problems
24) cc.complexity-theory - Techniques for proving NP completeness for a specific sequence of instances
25) cc.complexity-theory - Is there known any complexity class containing online counterparts of optimization problems?
26) cc.complexity-theory - Algebraic (or numeric) invariants of complexity classes
27) cc.complexity-theory - Quantum analogues of SPACE complexity classes
28) cc.complexity-theory - Communication Complexity ...Classes?
29) complexity-classes - Which is the approximation class of Minimum 0-1 integer programming if only non-negative integers are allowed?
30) reference-request - Is there any known Poly-APX-complete minimimization problem?
31) cc.complexity-theory - Does P contain incomprehensible languages? (TCS community wiki)
32) cc.complexity-theory - Interactive Proofs via Postselection?
33) cc.complexity-theory - PH and Optimization Problems
34) complexity-classes - Which subproblems of 3SAT are still NP complete?
35) cc.complexity-theory - Complexity of unique coloring of graphs
36) ds.algorithms - For which values of $k$ is the $k$-disjoint paths problem in $\mathcal{P}$?
37) cc.complexity-theory - Proof Complexity and Circuit Lower bound for coNP
38) complexity-classes - What's the complexity of counting odd nodes in graph?
39) cc.complexity-theory - Parallel (NC) replacements for Gaussian elimination?
40) cc.complexity-theory - Why are NPI problems not all of the same complexity?
41) cc.complexity-theory - Natural candidate against the Isomorphism Conjecture?
42) cc.complexity-theory - Is there a natural restriction of VO logic which captures P or NP?
43) reference-request - Cutting-sticks puzzle
44) cc.complexity-theory - What is the complexity of this game?
45) cc.complexity-theory - A variant of Critical SAT in DP
46) cc.complexity-theory - variant of Critical SAT
47) complexity-classes - Complete problem in $\Sigma_2^p$ - $\Sigma_{2}SAT$
48) reference-request - A good reference for complexity class operators?
49) cc.complexity-theory - Does $VP \neq VNP$ imply $P \neq NP$?
50) cc.complexity-theory - What are the consequences of solving XOR 3-SAT in Logspace?