Bernd Borchert

According to our database, Bernd Borchert authored at least 22 papers between 1994 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Few Product Gates but Many Zeroes.

Bernd Borchert, Pierre McKenzie, Klaus Reinhardt

Chic. J. Theor. Comput. Sci., 2013

Online Banking with NFC-Enabled Bank Card and NFC-Enabled Smartphone.

Max Günther, Bernd Borchert

Proceedings of the Information Security Theory and Practice. Security of Mobile and Cyber-Physical Systems, 2013

Indirect NFC-login.

Bernd Borchert, Max Günther

Proceedings of the 8th International Conference for Internet Technology and Secured Transactions, 2013

2009

Few Product Gates But Many Zeros.

Bernd Borchert, Pierre McKenzie, Klaus Reinhardt

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Formal Language Characterizations of P, NP, and PSPACE.

Bernd Borchert

J. Autom. Lang. Comb., 2008

2007

Deterministically and Sudoku-Deterministically Recognizable Picture Languages.

Bernd Borchert, Klaus Reinhardt

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Searching Paths of Constant Bandwidth.

Bernd Borchert, Klaus Reinhardt

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005

The dot-depth and the polynomial hierarchies correspond on the delta levels.

Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien

Int. J. Found. Comput. Sci., 2005

2004

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.

Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien

Proceedings of the Developments in Language Theory, 2004

2001

Dot operators.

Bernd Borchert, Riccardo Silvestri

Theor. Comput. Sci., 2001

2000

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory.

Bernd Borchert, Frank Stephan

Math. Log. Q., 2000

Restrictive Acceptance Suffices for Equivalence Problems.

Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe

LMS J. Comput. Math., 2000

1997

A Characterization of the Leaf Language Classes.

Bernd Borchert, Riccardo Silvestri

Inf. Process. Lett., 1997

On Existentially First-Order Definable Languages and their Relation to NP

Bernd Borchert, Dietrich Kuske, Frank Stephan

Electron. Colloquium Comput. Complex., 1997

The General Notion of a Dot-Operator.

Bernd Borchert, Riccardo Silvestri

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept.

Bernd Borchert, Antoni Lozano

Inf. Process. Lett., 1996

Looking for an Analogue of Rice's Theorem in Complexity Theory

Bernd Borchert, Frank Stephan

Electron. Colloquium Comput. Complex., 1996

Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems

Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe

Electron. Colloquium Comput. Complex., 1996

On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions

Bernd Borchert, Desh Ranjan, Frank Stephan

Electron. Colloquium Comput. Complex., 1996

1995

On the Acceptance Power of Regular Languages.

Bernd Borchert

Theor. Comput. Sci., 1995

1994

Predicate Classes and Promise Classes.

Bernd Borchert

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

Predicate classes, promise classe, and the acceptance power of regular languages.

Bernd Borchert

PhD thesis, 1994