Pages that link to "Item:Q4286227"

The following pages link to A Complexity Index for Satisfiability Problems (Q4286227):

Displaying 19 items.

• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
• Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← 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)
• On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
• Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
• A complete adaptive algorithm for propositional satisfiability (Q1811072) (← 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)
• Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
• The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← 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 artificial neural network satisfiability tester (Q4329689) (← links)
• Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)