Tag: np

Found 54 results for 'np'.

1) cc.complexity-theory - Hardness of parameterized CLIQUE?
2) cc.complexity-theory - NP-intermediate problems with efficient quantum solutions
3) cc.complexity-theory - NP completeness of classes of spanning trees
4) cc.complexity-theory - Is finding whether k different perfect matchings exist in a bipartite graph co-NP?
5) cc.complexity-theory - Complexity of a satisfiability problem
6) cc.complexity-theory - Are there any known NP problems which are conjectured to be exponentially hard on average?
7) cc.complexity-theory - NP-intermediate problems with efficient quantum solutions
8) cc.complexity-theory - $NP$-complete problem with quasi-polynomial bound on the number of solutions
9) cc.complexity-theory - Two Variants of NP
10) cc.complexity-theory - Are there "NP-Intermediate-Complete" problems?
11) ds.algorithms - Are there known NP-complete problems, neither NP-hard in the strong sense nor having pseudopolynomial algorithm?
12) cc.complexity-theory - Is the Witness Size of Membership for Every NP Language Already Known?
13) graph-theory - Minimal polynomial reduction of dominating set to max clique
14) cc.complexity-theory - Non-Uniform vs. Uniform Adversaries
15) cc.complexity-theory - Problems in NP but not in Average-P/poly
16) cc.complexity-theory - Best known deterministic time complexity lower bound for a natural problem in NP
17) cc.complexity-theory - Highest lower bound on NP problems (TSP)
18) cc.complexity-theory - Public-key encryption without the assumption that $P \neq NP$
19) np - Can NP-hard statements be proved by PCPs that only involve reading 2 bits?
20) cc.complexity-theory - $\mathsf{DTime}(O(n^k)) \subseteq \mathsf{NTime}(g)$ for some $g \in o(n^k)$?
21) cc.complexity-theory - Natural problems in $NP \cap coNP$ not in $UP \cap coUP$?
22) reductions - Analogues of the Berman Hartmanis conjecture and the Creativity Hypothesis
23) np - Euclidean TSP in NP and square root complexity
24) cc.complexity-theory - Does p-isomorphism preserve phase transition?
25) cc.complexity-theory - What is $\mathsf{NP}$ restricted to linear size witnesses?
26) cc.complexity-theory - Reduction of graph chromatic number to hypergraph 2-colorability
27) cc.complexity-theory - NP vs co-NP and second-order logic
28) cc.complexity-theory - Is there a simple game with asymmetric complexity?
29) reference-request - Dividing users with certain files into 2 equal groups
30) cc.complexity-theory - Best known joint containments for/by NP and Parity-P?
31) cc.complexity-theory - If BQP contains NP, does this mean that P=NP?
32) cc.complexity-theory - Implications of proving NP=RP on complexity theory
33) cc.complexity-theory - Does PSPACE-completeness imply approximation hardness?
34) cc.complexity-theory - How much would a SAT oracle help speeding up polynomial time algorithms?
35) np - When was co-NP introduced for the first time?
36) cc.complexity-theory - Consequences and state-of-the-art of NP ≠ ZPP?
37) cc.complexity-theory - Is there a complexity theory analogue of Rice's theorem in computability theory?
38) cc.complexity-theory - Is there an NP-complete language that contains precisely half of the n-bit instances?
39) reductions - Nontrivial membership in NP
40) complexity-classes - Intersection of languages in NP
41) complexity-classes - Is $\sf{P^{NP \cap coNP}} = \sf{NP \cap coNP}$?
42) cc.complexity-theory - A decision problem which is not known to be in PH but will be in P if P=NP
43) soft-question - (How) Could we discover/analyze NP problems in the absence of the Turing model of computation?
44) ds.algorithms - Is Degrees Of Separation NP Complete?
45) np - Are There Highly Symmetric NP- or P-complete Languages?
46) cc.complexity-theory - Does every Turing-recognizable undecidable language have a NP-complete subset?
47) sat - Understanding non-equivalence of proof lengths according to proof systems
48) cc.complexity-theory - What relations has different bounds for NP?
49) np-hardness - Balls & Bins: A punishment and reward game
50) graph-theory - List of NP-Complete graph problems/ properties?