Tag: np-complete

Found 62 results for 'np-complete'.

1) graph-algorithms - Relationship between two graph optimization problems
2) graph-theory - Problem of graph bi-partition (related to graph isomorphism)
3) cc.complexity-theory - Can a natural graph problem be universally hard?
4) co.combinatorics - Subset Sum Problem and hard looking instances that are not really hard
5) graph-theory - Complexity of finding the largest induced subgraph with all even degrees
6) cc.complexity-theory - Complexity of finding Exact Size Cut-Sets in Bipartite Graphs
7) cc.complexity-theory - How can you prove that a problem is not solvable in a certain time complexity?
8) np-hardness - NP-Complete problems that admit an efficient algorithm under the promise of a unique solution
9) cc.complexity-theory - NP completeness of Hamiltonian cycle for the family of *dual graphs* to plane, cubic, triply connected graphs?
10) cc.complexity-theory - NP complete graph problems about structural properties
11) graph-theory - Is the maximum independent set in cubic planar graphs NP-complete?
12) cc.complexity-theory - Natural candidate against the Isomorphism Conjecture?
13) reference-request - $NP$ completeness of Hamiltonicity of cubic polyhedral plane graphs with bounded face degree?
14) cc.complexity-theory - Verifying that a reduction is correct
15) np-hardness - Password hashing using NP complete problems
16) cc.complexity-theory - Natural candidates for NP-E and E-NP
17) np-hardness - What languages can be reduced to a NP-complete problem in polynomial time
18) permutations - Finding the identity with permutation chains
19) np-hardness - Is the weighted sum of subset prefix product problem NP-hard?
20) np-complete - Is the problem NP-C or polynomially solvable?
21) reductions - Analogues of the Berman Hartmanis conjecture and the Creativity Hypothesis
22) linear-programming - NP completeness of linear $0-1$ assignment problem
23) cc.complexity-theory - Does p-isomorphism preserve phase transition?
24) cc.complexity-theory - Is deciding whether all satisfying assignments are NAE assignments coNP-complete?
25) cc.complexity-theory - ETH-Hardness of $Gap\text-MAX\text-3SAT_{c}$
26) cc.complexity-theory - Can MONOTONE WSAT be in solved in polynomial time?
27) cc.complexity-theory - Is balanced Hamiltonian cycle NP complete on maximal plane graphs?
28) zero-knowledge - Are there any implementations for zero-knowledge proofs of NP-complete problems?
29) cc.complexity-theory - On Zero sum perfect matching
30) cc.complexity-theory - Reduction of graph chromatic number to hypergraph 2-colorability
31) np-complete - NP-completeness: sum of "some" paths in a spanning tree
32) cc.complexity-theory - Are there any heuristic-free NP complete problems?
33) np-complete - NP-Complete Static Square Puzzles
34) graph-theory - How to show that Color Tiles is NP-Complete
35) cc.complexity-theory - Fixed parameter tractable Integer Programming and $FPP$
36) complexity-classes - Isn't it "trivial" to represent/reduce any classical physics problem into a Spin-Glass which is NP-Complete?
37) complexity-classes - Isn't it "trivial" to represent/reduce any classical physics problem into a Spin-Glass which is NP-Complete?
38) np-hardness - Lexicographic Boolean satisfiability
39) cc.complexity-theory - How much would a SAT oracle help speeding up polynomial time algorithms?
40) relativization - Does the Cook-Levin theorem relativize?
41) cc.complexity-theory - Is there an NP-complete language that contains precisely half of the n-bit instances?
42) np-complete - Multiple subset sum where subsets have complementary cardinality
43) cc.complexity-theory - Poly time superset of NP complete language with infinitely many strings excluded from it
44) counting-complexity - On polytope lattice points
45) randomness - Hardness assumption: an NP-complete problem whose ratio of hard instances do not tend to zero?
46) cc.complexity-theory - Is Prime Bounded Quadratic Congruence NP-complete?
47) cc.complexity-theory - in SAT resolution proofs, are all DAGs possible?
48) np-complete - Does BQP contain any NP-Complete problem?
49) polynomial-time - Any result connecting an NP-complete problem with slight super-polynomial time?
50) np-hardness - Balls & Bins: A punishment and reward game