Pages that link to "Item:Q5402560"
From MaRDI portal
The following pages link to The complexity of satisfiability problems (Q5402560):
Displaying 50 items.
- The expressive rate of constraints (Q812391) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Hardness results on the man-exchange stable marriage problem with short preference lists (Q845882) (← links)
- Nonnegative integral subset representations of integer sets (Q845914) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310) (← links)
- Existence of simple propositional formulas (Q917333) (← links)
- Pattern matching and membership for hierarchical message sequence charts (Q927396) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- The inequality-satisfiability problem (Q935232) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Complexity of (p,1)-total labelling (Q967327) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- Integer programming with 2-variable equations and 1-variable inequalities (Q987826) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- A minimization version of a directed subgraph homeomorphism problem (Q1014308) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Stable matching problems with exchange restrictions (Q1016052) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- NP-hard and linear variants of hypergraph partitioning (Q1041217) (← links)
