Jan Johannsen

Available identifiers

zbMath Open johannsen.janMaRDI QIDQ293308

List of research outcomes

Publication	Date of Publication	Type
On sharply bounded length induction	2024-06-21	Paper
On Linear Resolution	2021-12-09	Paper
Backdoors into Two Occurrences	2021-12-01	Paper
Simplified and improved separations between regular and general resolution by lifting	2021-04-07	Paper
An elementary fragment of second-order lambda calculus	2017-07-12	Paper
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers	2016-09-05	Paper
Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes	2016-06-09	Paper
Improved Separations of Regular Resolution from Clause Learning Proof Systems	2014-05-16	Paper
Bounded model checking for all regular properties	2013-09-26	Paper
Exponential Separations in a Hierarchy of Clause Learning Proof Systems	2013-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q3002781	2011-05-24	Paper
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas	2010-09-29	Paper
An exponential separation between regular and general resolution	2010-08-05	Paper
An Exponential Lower Bound for Width-Restricted Clause Learning	2009-07-07	Paper
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning	2009-04-29	Paper
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity	2008-04-11	Paper
STACS 2004	2007-10-01	Paper
The complexity of pure literal elimination	2007-01-24	Paper
An unexpected separation result in Linearly Bounded Arithmetic	2005-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q4449218	2004-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4436023	2003-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4708587	2003-06-18	Paper
https://portal.mardi4nfdi.de/entity/Q4944913	2002-07-14	Paper
Cumulative Higher-Order Logic as a Foundation for Set Theory	2001-03-22	Paper
On the relative complexity of resolution refinements and cutting planes proof systems	2001-03-19	Paper
Depth lower bounds for monotone semi-unbounded fan-in circuits.	2001-01-01	Paper
A Remark on Independence Results for Sharply Bounded Arithmetic	1999-08-31	Paper
A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications	1998-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q4375791	1998-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4893147	1996-09-01	Paper
A note on sharply bounded arithmetic	1994-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q4282609	1994-03-17	Paper

Research outcomes over time

This page was built for person: Jan Johannsen