Pages that link to "Item:Q1337669"
From MaRDI portal
The following pages link to Recognition of \(q\)-Horn formulae in linear time (Q1337669):
Displaying 25 items.
- Backdoors to q-Horn (Q261394) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- On connected Boolean functions (Q1961460) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- On the size of maximum renamable Horn sub-CNF (Q2387435) (← links)
- On propositional definability (Q2389643) (← links)
- A sharp threshold for the renameable-Horn and the \(q\)-Horn properties (Q2581546) (← links)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Bounds on the size of PC and URC formulas (Q5145828) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
