1.On the Power of Different Types of Restricted Branching Programs

作　　者：Beate Bollig ;Martin Sauerhoff ;Detlef Sieling 等

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

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

文章 ID：88774746

文章详细全文下载

2.On the Minimization of (Complete) Ordered Binary Decision Diagrams

作　　者：Beate Bollig

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

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

文章 ID：95928626

文章详细全文下载

3.A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs

作　　者：Beate Bollig

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

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

文章 ID：47146936

文章详细全文下载

4.Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

作　　者：Beate Bollig ;Philipp Woelfel ;Stephan Waack

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

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

文章 ID：47147049

文章详细全文下载

5.Approximability and Nonapproximability by Binary Decision Diagrams

作　　者：Beate Bollig, Ingo Wegener

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

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

文章 ID：47840799

文章详细全文下载

6.Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

作　　者：Beate Bollig

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

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

文章 ID：47840805

文章详细全文下载

7.Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems

作　　者：Beate Bollig, Ingo Wegener

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

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

文章 ID：49468967

文章详细全文下载

8.Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams

作　　者：Beate Bollig, Ingo Wegener

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

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

文章 ID：73953783

文章详细全文下载

9.Testing Membership in Formal Languages Implicitly Represented by Boolean Functions

作　　者：Beate Bollig

出　　处：Journal of Universal Computer Science. 2006 ;12(6):710-724.

出版社：Graz University of Technology and Know-Center

文章 ID：186875287

文章详细

	有本地全文	8篇
	有全文链接	1篇

	德国	8篇
	奥地利	1篇

全文

出版年度

作者

来源期刊

学科主题

语种

国别/地区

检索条件:"( ( 高级检索(( ((AU:(("Beate Bollig")))) )) ) )"

	Beate Bollig	6篇
	Beate Bollig, Ingo Wegener	3篇
	Detlef Sieling	1篇
	Ingo Wegener	1篇
	Martin Sauerhoff	1篇

	Electronic Colloquium on Computational Complexity	8篇
	Journal of Universal Computer Science	1篇