Pages that link to "Item:Q5402560"
From MaRDI portal
The following pages link to The complexity of satisfiability problems (Q5402560):
Displaying 50 items.
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Finding non-orientable surfaces in 3-manifolds (Q1688857) (← links)
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Crane scheduling in railway yards: an analysis of computational complexity (Q1707828) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- On the complexity of graph coloring with additional local conditions (Q1708276) (← links)
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
- On bijunctive predicates over a finite set (Q1741483) (← links)
- Network pollution games (Q1755784) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- New algorithms for exact satisfiability (Q1770407) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- On the complexity of deciding typability in the relational algebra (Q1777227) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- Pushing the frontier of minimality (Q1786605) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Faster exact solutions for some NP-hard problems. (Q1853491) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- Complexity of nilpotent unification and matching problems. (Q1854363) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- On the complexity of minmax regret linear programming (Q1887882) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Complexity of generalized satisfiability counting problems (Q1917076) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- Proof of the interval satisfiability conjecture (Q1924736) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) (← links)
- On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Satisfiability threshold for random XOR-CNF formulas (Q1961446) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- Independent sets with domination constraints (Q1962033) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
