The following pages link to Samuel R. Buss (Q195654):
Displaying 50 items.
- (Q164286) (redirect page) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Limits on alternation trading proofs for time-space lower bounds (Q496301) (← links)
- Intuitionistic validity in \(T\)-normal Kripke structures (Q685055) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- The modal logic of pure provability (Q749522) (← links)
- (Q904150) (redirect page) (← links)
- Cobham recursive set functions (Q904151) (← links)
- Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- On truth-table reducibility to SAT (Q1173957) (← links)
- The undecidability of \(k\)-provability (Q1176199) (← links)
- Propositional consistency proofs (Q1177033) (← links)
- The graph of multiplication is equivalent to counting (Q1190513) (← links)
- Good degree bounds on Nullstellensatz refutations of the induction principle (Q1276164) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- The complexity of the disjunction and existential properties in intuitionistic logic (Q1304542) (← links)
- Size-depth tradeoffs for Boolean formulae (Q1318766) (← links)
- (Q1377576) (redirect page) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Unprovability of consistency statements in fragments of bounded arithmetic (Q1896613) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Some remarks on lengths of propositional proofs (Q1908815) (← links)
- Cutting planes, connectivity, and threshold logic (Q1908818) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- DRAT proofs, propagation redundancy, and extended resolution (Q2181921) (← links)
- DRMaxSAT with MaxHS: first contact (Q2181935) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- On transformations of constant depth propositional proofs (Q2311211) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination (Q2350976) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- The prospects for mathematical logic in the twenty-first century (Q2736583) (← links)
- An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Q2843321) (← links)
- Alternation Trading Proofs and Their Limitations (Q2849894) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- Fragments of approximate counting (Q2921008) (← links)
- Sub-computable Boundedness Randomness (Q2938768) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Injection Structures Specified by Finite State Transducers (Q2970970) (← links)
