Bernd Borchert

发表

The Circuit Subfunction Relations are Σ p 2-complete

Desh Ranjan, Bernd Borchert, .

Restrictive Acceptance Suffices for Equivalence Problems

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

The Complexity of Mind Changes

Bernd Borchert, 1993 .

Representations and Leaf Languages are Basically the same Concept

Antoni Lozano, Bernd Borchert, 1995 .

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

Frank Stephan, Bernd Borchert, 2000 .

The circuit subfunction relations are $sum^P_2$-complete

Desh Ranjan, Bernd Borchert, 1993 .

The atnext/atprevious Hierarchy on the Starfree Languages

Pascal Tesson, Bernd Borchert, 2004 .