Searching for authors named "Jan Johannsen" – sorted by Relevance.
-
The Lattice of Propositional Proof Systems
- The Lattice of Propositional Proof Systems Jan Johannsen Preliminary Notes Proof systems form a
- Add To MetaCart
-
The Complexity of Satisfiability Problems with Two Occurrences
- The Complexity of Satisability Problems with Two Occurrences Jan Johannsen LMU Munchen Let CNF(2
- Add To MetaCart
-
A Bounded Arithmetic Theory for Constant Depth Threshold Circuits
- A Bounded Arithmetic Theory for Constant Depth Threshold Circuits Jan Johannsen IMMD 1
- Cited by 7 (4 self) – Add To MetaCart
-
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K
- Weak Bounded Arithmetic, the Die-Hellman Problem and Constable's Class K Jan Johannsen Dept
- Cited by 2 (0 self) – Add To MetaCart
-
A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications
- A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications Jan Johannsen IMMD
- Cited by 5 (0 self) – Add To MetaCart
-
Equational Calculi and Constant Depth Propositional Proofs
- Calculi and Constant Depth Propositional Proofs Jan Johannsen Abstract. We define equational calculi
- Cited by 4 (1 self) – Add To MetaCart
-
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
- Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits Jan Johannsen Institut f
- Cited by 1 (0 self) – Add To MetaCart
-
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes
- Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes Jan
- Cited by 5 (2 self) – Add To MetaCart
-
Elements Definable by Nonstandard Sigma n -Formulae in Models of Peano Arithmetic
- Elements Denable by Nonstandard n -Formulae in Models of Peano Arithmetic Jan Johannsen Universit
- Add To MetaCart
-
On Threshold Logic and Cutting Planes Proofs
- On Threshold Logic and Cutting Planes Proofs Peter Clote Jan Johannsen December 14, 1998 Yet
- Add To MetaCart

