The following pages link to Jan Johannsen (Q293308):
Displaying 32 items.
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- A note on sharply bounded arithmetic (Q1325055) (← links)
- Simplified and improved separations between regular and general resolution by lifting (Q2661346) (← links)
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120) (← links)
- Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits (Q2773024) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- (Q2848673) (← links)
- (Q3002781) (← links)
- An exponential separation between regular and general resolution (Q3579185) (← links)
- Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning (Q3623009) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- A Remark on Independence Results for Sharply Bounded Arithmetic (Q4224090) (← links)
- (Q4282609) (← links)
- (Q4375791) (← links)
- A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications (Q4393170) (← links)
- (Q4436023) (← links)
- (Q4449218) (← links)
- Cumulative Higher-Order Logic as a Foundation for Set Theory (Q4487243) (← links)
- An unexpected separation result in Linearly Bounded Arithmetic (Q4666949) (← links)
- (Q4708587) (← links)
- (Q4893147) (← links)
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (Q4930576) (← links)
- (Q4944913) (← links)
- Backdoors into Two Occurrences (Q5014282) (← links)
- On Linear Resolution (Q5015599) (← links)
- An elementary fragment of second-order lambda calculus (Q5277728) (← links)
- STACS 2004 (Q5309710) (← links)
- Exponential Separations in a Hierarchy of Clause Learning Proof Systems (Q5326452) (← links)
- Improved Separations of Regular Resolution from Clause Learning Proof Systems (Q5415765) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- On sharply bounded length induction (Q6560178) (← links)
