default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernd Borchert
Person information
- affiliation: University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j11]Bernd Borchert, Pierre McKenzie, Klaus Reinhardt:
Few Product Gates but Many Zeroes. Chic. J. Theor. Comput. Sci. 2013 (2013)- [c12]Bernd Borchert, Max Günther:
Indirect NFC-login. ICITST 2013: 204-209 - [c11]Max Günther, Bernd Borchert:
Online Banking with NFC-Enabled Bank Card and NFC-Enabled Smartphone. WISTP 2013: 66-81
2000 – 2009
- 2009
- [c10]Bernd Borchert, Pierre McKenzie, Klaus Reinhardt:
Few Product Gates But Many Zeros. MFCS 2009: 162-174 - 2008
- [j10]Bernd Borchert:
Formal Language Characterizations of P, NP, and PSPACE. J. Autom. Lang. Comb. 13(3/4): 161-183 (2008) - 2007
- [c9]Bernd Borchert, Klaus Reinhardt:
Deterministically and Sudoku-Deterministically Recognizable Picture Languages. LATA 2007: 175-186 - 2006
- [c8]Bernd Borchert, Klaus Reinhardt:
Searching Paths of Constant Bandwidth. SOFSEM 2006: 187-196 - 2005
- [j9]Bernd Borchert, Klaus-Jörn Lange, Frank Stephan
, Pascal Tesson, Denis Thérien:
The dot-depth and the polynomial hierarchies correspond on the delta levels. Int. J. Found. Comput. Sci. 16(4): 625-644 (2005) - 2004
- [c7]Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien:
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. Developments in Language Theory 2004: 89-101 - 2001
- [j8]Bernd Borchert, Riccardo Silvestri:
Dot operators. Theor. Comput. Sci. 262(1): 501-523 (2001) - 2000
- [j7]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. LMS J. Comput. Math. 3: 86-95 (2000) - [j6]Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Math. Log. Q. 46(4): 489-504 (2000)
1990 – 1999
- 1999
- [j5]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On existentially first-order definable languages and their relation to NP. RAIRO Theor. Informatics Appl. 33(3): 259-270 (1999) - [c6]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. FCT 1999: 124-135 - [i6]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Restrictive Acceptance Suffices for Equivalence Problems. CoRR cs.CC/9907041 (1999) - 1998
- [j4]Bernd Borchert, Desh Ranjan, Frank Stephan:
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. Theory Comput. Syst. 31(6): 679-693 (1998) - [c5]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28 - 1997
- [j3]Bernd Borchert, Riccardo Silvestri:
A Characterization of the Leaf Language Classes. Inf. Process. Lett. 63(3): 153-158 (1997) - [c4]Bernd Borchert, Riccardo Silvestri:
The General Notion of a Dot-Operator. CCC 1997: 36-44 - [c3]Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. Kurt Gödel Colloquium 1997: 114-127 - [i5]Bernd Borchert, Dietrich Kuske, Frank Stephan:
On Existentially First-Order Definable Languages and their Relation to NP. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j2]Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59(4): 211-215 (1996) - [i4]Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept. Electron. Colloquium Comput. Complex. TR96 (1996) - [i3]Bernd Borchert, Desh Ranjan, Frank Stephan:
On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe:
Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Bernd Borchert, Frank Stephan:
Looking for an Analogue of Rice's Theorem in Complexity Theory. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j1]Bernd Borchert:
On the Acceptance Power of Regular Languages. Theor. Comput. Sci. 148(2): 207-225 (1995) - 1994
- [b1]Bernd Borchert:
Predicate classes, promise classe, and the acceptance power of regular languages. University of Heidelberg, Germany, 1994, pp. I-IV, 1-64 - [c2]Bernd Borchert:
Predicate Classes and Promise Classes. SCT 1994: 235-241 - [c1]Bernd Borchert:
On the Acceptance Power of Regular Languages. STACS 1994: 533-541
Coauthor Index
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 22:48 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:
