Pages that link to "Item:Q4507332"

The following pages link to On Interpolation and Automatization for Frege Systems (Q4507332):

Displaying 31 items.

• Towards NP-P via proof complexity and search (Q408544) (← links)
• Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
• Extended clause learning (Q622116) (← links)
• Proof complexity of propositional default logic (Q647339) (← links)
• Mean-payoff games and propositional proofs (Q716324) (← links)
• Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
• Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
• Quantum deduction rules (Q1001909) (← links)
• On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
• The proof complexity of linear algebra (Q1886325) (← links)
• On the automatizability of polynomial calculus (Q1959382) (← links)
• On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
• Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
• Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Automatizability and Simple Stochastic Games (Q3012836) (← links)
• Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
• Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
• A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
• Boundary Points and Resolution (Q3637164) (← links)
• Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
• (Q5013887) (← links)
• INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• (Q5092398) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Proof Complexity of Non-classical Logics (Q5894972) (← links)