Deutsch
Login
Home
Search
Browse
Publish
FAQ
Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
Close
Author(s)
All words
At least one word
None of the words
Title
All words
At least one word
None of the words
Additional Person(s)
All words
At least one word
None of the words
Referee(s)
All words
At least one word
None of the words
Abstract
All words
At least one word
None of the words
Fulltext
All words
None of the words
Refine
Author
Brosenne, Henrik
(1)
Homeister, Matthias
(1)
Waack, Stephan
(1)
Year of publication
2002 (1)
(remove)
Document Type
Article
(1)
Language
English
(1)
Has Fulltext
no
(1)
Is part of the Bibliography
yes
(1)
Keywords
Well-structured graph-driven parity-FBDDs
(1)
complexity theory
(1)
data structures for Boolean functions
(1)
lower bounds
(1)
minimization algorithm
(1)
1
search hit
1
to
1
Export
BibTeX
CSV
RIS
XML
100
10
20
50
100
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
(2002)
Brosenne, Henrik
;
Homeister, Matthias
;
Waack, Stephan
1
to
1
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu.
Unsere Datenschutzerklärung finden Sie hier.