Pages that link to "Item:Q2784492"
From MaRDI portal
The following pages link to The Efficiency of Resolution and Davis--Putnam Procedures (Q2784492):
Displaying 25 items.
- Lower bounds for \(k\)-DNF resolution on random 3-CNFs (Q430840) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- When does the giant component bring unsatisfiability? (Q1046740) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- Counting for satisfiability by inverting resolution (Q2386352) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)
- On Random Betweenness Constraints (Q4911112) (← links)
- On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
