1.Few Product Gates but Many Zeroes

作　　者：Bernd Borchert ;Pierre McKenzie ;Klaus Reinhardt

出　　处：Chicago Journal of Theoretical Computer Science. 2013 ;2013.

出版社：MIT Press ; University of Chicago, Department of Computer Science

文章 ID：85479197

文章详细全文下载
2.On Existentially First-Order Definable Languages and their Relation to NP

作　　者：Bernd Borchert ;Dietrich Kuske ;Frank Stephan

出　　处：Electronic Colloquium on Computational Complexity. 1997 ;1997.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：49468490

文章详细全文下载
3.Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept

作　　者：Bernd Borchert, Antoni Lozano

出　　处：Electronic Colloquium on Computational Complexity. 1996 ;1996.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：73953158

文章详细全文下载
4.On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions

作　　者：Bernd Borchert ;Desh Ranjan ;Frank Stephan

出　　处：Electronic Colloquium on Computational Complexity. 1996 ;1996.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：73953627

文章详细全文下载
5.Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems

作　　者：Bernd Borchert ;Lane A. Hemaspaandra ;Jörg Rothe

出　　处：Electronic Colloquium on Computational Complexity. 1996 ;1996.

出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung

文章 ID：73953653

文章详细全文下载

	德国	4篇
	美国	1篇

全文

出版年度

作者

来源期刊

学科主题

语种

国别/地区

检索条件:"( ( 高级检索(( ((AU:(("Bernd Borchert")))) )) ) )"

	Bernd Borchert	4篇
	Frank Stephan	2篇
	Bernd Borchert, Antoni Lozano	1篇
	Desh Ranjan	1篇
	Dietrich Kuske	1篇

	Jörg Rothe	1篇
	Klaus Reinhardt	1篇
	Lane A. Hemaspaandra	1篇
	Pierre McKenzie	1篇

	Electronic Colloquium on Computational Complexity	4篇
	Chicago Journal of Theoretical Computer Science	1篇

	2013	1篇
	1997	1篇
	1996	3篇