Pages that link to "Item:Q1061485"
From MaRDI portal
The following pages link to The complexity of facets (and some facets of complexity) (Q1061485):
Displayed 50 items.
- Removing redundancy from a clause (Q685346) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Probabilistic polynomial time is closed under parity reductions (Q751270) (← links)
- On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- More complicated questions about maxima and minima, and some closures of NP (Q1107524) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- The complexity of facets resolved (Q1109565) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- The complexity of controlled selection (Q1173958) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Correlation polytopes: Their geometry and complexity (Q1176573) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Polynomial-time compression (Q1198955) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- On the complexity of computing the diameter of a polytope (Q1337144) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- The unique Horn-satisfiability problem and quadratic Boolean equations. (Q1353999) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- A special case for subset interconnection designs (Q1377654) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Rationality and intelligence (Q1391347) (← links)
- On the computational complexity of determining polyatomic structures by X-rays (Q1575953) (← links)
- On subclasses of minimal unsatisfiable formulas (Q1841884) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)