default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Johannsen
- > Home > Persons > Jan Johannsen
Publications
- 2020
[j15]Jan Johannsen:
Backdoors into Two Occurrences. J. Satisf. Boolean Model. Comput. 12(1): 1-15 (2020)- 2013
- [c17]Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. SAT 2013: 40-51 - [i8]Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2009
- [c14]Jan Johannsen:
An Exponential Lower Bound for Width-Restricted Clause Learning. SAT 2009: 128-140 - 2005
- [j10]Jan Johannsen:
The Complexity of Pure Literal Elimination. J. Autom. Reason. 35(1-3): 89-95 (2005) - 2004
- [c11]Jan Johannsen:
Satisfiability Problems Complete for Deterministic Logarithmic Space. STACS 2004: 317-325 - 2001
- [j7]Jan Johannsen:
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. RAIRO Theor. Informatics Appl. 35(3): 277-286 (2001) - 1999
- [c6]Jan Johannsen:
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. LICS 1999: 268-274 - 1998
- [j4]Jan Johannsen:
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes. Inf. Process. Lett. 67(1): 37-41 (1998) - [j3]Jan Johannsen:
A Model Theoretic Property of Sharply Bounded Formulae, with some Applications. Math. Log. Q. 44: 205-215 (1998) - [j2]Jan Johannsen:
A Remark on Independence Results for Sharply Bounded Arithmetic. Math. Log. Q. 44: 568-570 (1998) - 1997
- [i1]Jan Johannsen:
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [b1]Jan Johannsen:
Schwache Fragmente der Arithmetik und Schwellwertschaltkreise beschränkter Tiefe. University of Erlangen-Nuremberg, Germany, 1996, pp. 1-118 - [c3]Jan Johannsen:
Equational calculi and constant depth propositional proofs. Proof Complexity and Feasible Arithmetics 1996: 149-162 - 1995
- [c2]Jan Johannsen:
On Sharply Bounded Length Induction. CSL 1995: 362-367 - 1994
- [j1]Jan Johannsen:
A note on sharply bounded arithmetic. Arch. Math. Log. 33(2): 159-165 (1994) - 1993
- [c1]Jan Johannsen:
On the Weakness of Sharply Bounded Polynomial Induction. Kurt Gödel Colloquium 1993: 223-230
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
