Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449): Difference between revisions

@@ Property / cites work @@
+Sublattices of the polynomial time degrees
@@ Property / cites work: Sublattices of the polynomial time degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Non-dichotomies in Constraint Satisfaction Complexity
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+The complexity of propositional closed world reasoning and circumscription
+Normal rank
@@ Property / cites work @@
+Linear FPT reductions and computational lower bounds
+Normal rank
@@ Property / cites work @@
+Understanding the Complexity of Induced Subgraph Isomorphisms
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+The complexity of logic-based abduction
@@ Property / cites work: The complexity of logic-based abduction / rank @@
+Normal rank
@@ Property / cites work @@
+Semantics and complexity of abduction from default theories
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of unions of disjoint sets
@@ Property / cites work: The complexity of unions of disjoint sets / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+Constraint solving via fractional edge covers
@@ Property / cites work: Constraint solving via fractional edge covers / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Closure properties of constraints
@@ Property / cites work: Closure properties of constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis
+Normal rank
@@ Property / cites work @@
+Computational complexity of linear constraints over the integers
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of sets in NP and other complexity classes
+Normal rank
@@ Property / cites work @@
+Function Algebras on Finite Sets
@@ Property / cites work: Function Algebras on Finite Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating fractional hypertree width
@@ Property / cites work: Approximating fractional hypertree width / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable hypergraph properties for constraint satisfaction and conjunctive queries
+Normal rank
@@ Property / cites work @@
+What makes propositional abduction tractable
@@ Property / cites work: What makes propositional abduction tractable / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of integer programming
@@ Property / cites work: On the complexity of integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform approach to obtain diagonal sets in complexity classes
+Normal rank
@@ Property / cites work @@
+Natural Self-Reducible Sets
@@ Property / cites work: Natural Self-Reducible Sets / rank @@
+Normal rank