Pages that link to "Item:Q5402560"
From MaRDI portal
The following pages link to The complexity of satisfiability problems (Q5402560):
Displaying 50 items.
- On recovering syntenic blocks from comparative maps (Q1041433) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- An algorithm for exact satisfiability analysed with the number of clauses as parameter (Q1045885) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Polynomially solvable satisfiability problems (Q1114394) (← links)
- Shortest enclosing walks and cycles in embedded graphs (Q1116348) (← links)
- Observations concerning a public-key cryptosystem based on iterated morphisms (Q1121851) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Backtracking with multi-level dynamic search rearrangement (Q1138385) (← links)
- An NP-complete matching problem (Q1166935) (← links)
- NP-completeness of some generalizations of the maximum matching problem (Q1168728) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Correlation polytopes: Their geometry and complexity (Q1176573) (← links)
- The complexity of model checking for circumscriptive formulae (Q1205713) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112) (← links)
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas (Q1262855) (← links)
- Constraints, consistency and closure (Q1274280) (← links)
- On the algebraic structure of combinatorial problems (Q1276253) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- A two-phase algorithm for solving a class of hard satisfiability problems (Q1306378) (← links)
- Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823) (← links)
- The \(k\)-SATISFIABILITY problem remains NP-complete for dense families (Q1322290) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Causal approximations (Q1342225) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← links)
- Recognition complexity for Schaefer classes (Q1382588) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Some variants of SAT and their properties (Q1425331) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- Pushing vertices in digraphs without long induced cycles (Q1613399) (← links)
- Nominal unification with atom-variables (Q1640638) (← links)
