#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1993

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
- Electronic Colloquium on Computational Complexity
- 2001

Two distinct proofs of an exponential separation between regular resolution and unrestricted resolution are given. The previous best known separation between these systems was quasi-polynomial.

- Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
- SIAM J. Comput.
- 2000

An exponential lower bound for the size of tree-like Cutting Planes refutations of a certain family of CN F formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the tree-like versions and the dag-like versions of resolution and Cutting Planes. In both cases only superpolynomial separations were known… (More)

- Hermann Gruber, Jan Johannsen
- FoSSaCS
- 2008

The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2 Θ(n) in the worst case for infinite languages, and for finite languages it is n Ω(log log n) and n O(log n) , if the alphabet size grows with the number of states n of the given automaton. A new lower… (More)

- Jan Johannsen, Martin Lange
- ICALP
- 2003

We show that the satisfiability problem for CTL + , the branching time logic that allows boolean combinations of path formulas inside a path quantifier but no nesting of them, is 2-EXPTIME-hard. The construction is inspired by Vardi and Stockmeyer's 2-EXPTIME-hardness proof of CTL * 's satisfiability problem. As a consequence, there is no subexponential… (More)

The theory b 1-CR of Bounded Arithmetic axiomatized by the b 1-bit-comprehension rule is defined and shown to be strongly related to the complexity class TC 0. The b 1-definable functions of b 1-CR are those in uniform TC 0 , and the b 2-definable functions are computable by counterexample computations using TC 0-functions. The latter is used to show that a… (More)

We define theories of Bounded Arithmetic characterizing classes of functions computable by constant-depth threshold circuits of polynomial and quasipoly-nomial size. Then we define certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via… (More)

- Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
- Proof Theory in Computer Science
- 2001

A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.

- Klaus Aehlig, Jan Johannsen
- ACM Trans. Comput. Log.
- 2005

A fragment of second-order lambda calculus (System <i>F</i>) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, that is, the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller level, with a slightly liberalized treatment of… (More)

- Wolfgang Degen, Jan Johannsen
- Math. Log. Q.
- 2000

The systems K of transsnite cumulative types up to are extended to systems K 1 that include a natural innnitary inference rule, the so-called limit rule. For countable a semantic completeness theorem for K 1 is proved by the method of reduction trees, and it is shown that every model of K 1 is equivalent to a cumulative hierarchy of sets. This is used to… (More)

- Samuel R. Buss, Jan Hoffmann, Jan Johannsen
- Logical Methods in Computer Science
- 2008

Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an exponential separation between regular dag-like resolution and both regular WRTL and regular WRTI is given. It is proved that… (More)