Deutsch
Login
Home
Search
Browse
Publish
FAQ
Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
Close
Dewey Decimal Classification
Informatik, Informationswissenschaft, allgemeine W...
Informatik, Wissen, Systeme
Datenverarbeitung; Informatik
Refine
Author
Homeister, Matthias (5)
(remove)
Year of publication
2007
(1)
2006
(2)
2003
(1)
2002
(1)
Document Type
Article (5)
(remove)
Language
English
(5)
Has Fulltext
no
(5)
Is part of the Bibliography
yes
(5)
Keywords
Computational complexity
(3)
lower bounds
(2)
Approximation
(1)
Branching programs
(1)
Computational Complexity
(1)
Existential, universal, parity, and majority acceptance mode
(1)
Lower bounds
(1)
Nondeterministic OBDD
(1)
Ordered binary decision diagrams with repeated tests
(1)
Parity OBDD
(1)
+ more
5
search hits
1
to
5
Export
BibTeX
CSV
RIS
XML
100
10
20
50
100
Sort by
Year
Year
Title
Title
Author
Author
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
(2002)
Brosenne, Henrik
;
Homeister, Matthias
;
Waack, Stephan
Lower bounds for restricted read-once parity branching programs
(2006)
Homeister, Matthias
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs
(2003)
Homeister, Matthias
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
(2006)
Brosenne, Henrik
;
Homeister, Matthias
;
Waack, Stephan
On approximation by ⊕-OBDDs
(2007)
Brosenne, Henrik
;
Damm, Carsten
;
Homeister, Matthias
;
Waack, Stephan
1
to
5
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu.
Unsere Datenschutzerklärung finden Sie hier.