Pages that link to "Item:Q4764348"
From MaRDI portal
The following pages link to Search Problems in the Decision Tree Model (Q4764348):
Displaying 18 items.
- The depth of resolution proofs (Q647405) (← links)
- On the complexity of finding a local maximum of functions on discrete planar subsets (Q1884980) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Instantly solvable search problems (Q3125965) (← links)
- The Complexity of Decision Versus Search (Q4286231) (← links)
- Effective Search Problems (Q4304108) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. (Q5111240) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- A resolution-based interactive proof system for UNSAT (Q6629521) (← links)