Searching for authors named "Bernd Borchert" – sorted by Relevance.
17 documents found, showing 1 through 10.
Next 10 →
-
The complexity of mind changes
- …The Complexity of Mind Changes 1 Introduction Bernd Borchert Abstract The notion of the maximal…
- Cited by 1 (0 self) – Add To MetaCart
-
On the acceptance power of regular languages
- …-225 On the acceptance power of regular languages Bernd Borchert Mathematisches Institut, Universitiit Heidelberg, Im…
- Cited by 14 (2 self) – Add To MetaCart
-
On the Acceptance Power of Regular Languages
- …Bernd Borchert Bericht Nr. 6 Februar 1994 On the Acceptance Power of Regular Languages Post…
- Add To MetaCart
-
The Characterization of the Leaf Language Classes
- … language classes 1 Introduction Bernd Borchert Universitat Heidelberg Riccardo Silvestri Universit`a di…
- Cited by 5 (2 self) – Add To MetaCart
-
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
- …Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory Bernd Borchert and Frank…
- Cited by 3 (0 self) – Add To MetaCart
-
Predicate Classes and Promise Classes
- …Predicate Classes and Promise Classes Bernd Borchert Bericht Nr. 7 April 1994 PostScript version…
- Cited by 2 (1 self) – Add To MetaCart
-
unknown title
- …FEW GATES BUT MANY ZEROS BERND BORCHERT 1 AND PIERRE MCKENZIE 2 AND KLAUS REINHARDT 1 1…
- Add To MetaCart
-
ISSN 0946-3852The Dot-Depth Hierarchy vs. Iterated Block Products of DA
- …The Dot-Depth Hierarchy vs. Iterated Block Products of DA Bernd Borchert WSI-2004-09 Universität…
- Add To MetaCart
-
Formal Language Characterizations of P, NP, and PSPACE
- …Formal Language Characterizations of P, NP, and PSPACE Bernd Borchert Wilhelm…
- Add To MetaCart
-
The Circuit Subfunction Relations are Σ p 2-complete
- …The Circuit Subfunction Relations are Σ p 2-complete Bernd Borchert Desh Ranjan Abstract We show…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
