Pages that link to "Item:Q3395034"
From MaRDI portal
The following pages link to Resolution Is Not Automatizable Unless W[P] Is Tractable (Q3395034):
Displaying 36 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Extended clause learning (Q622116) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- The parameterized complexity of probability amplification (Q975525) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Data compression for proof replay (Q1040776) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- On space and depth in resolution (Q1616620) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Parameterized random complexity (Q1946497) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Parameterized counting problems (Q2576944) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- Parameterized Derandomization (Q3503586) (← links)
- Boundary Points and Resolution (Q3637164) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
