|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 9 keywords
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
52 | Martin Sauerhoff |
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Wolfgang Günther 0001, Rolf Drechsler |
Implementation of Read- k-times BDDs on Top of Standard BDD Packages. |
VLSI Design |
2001 |
DBLP DOI BibTeX RDF |
|
37 | Juraj Hromkovic, Martin Sauerhoff |
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Martin Sauerhoff |
Randomized Branching Programs. |
SAGA |
2001 |
DBLP DOI BibTeX RDF |
Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD |
26 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. |
CCC |
2001 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs |
19 | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. |
Theory Comput. Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
19 | Farid M. Ablayev, Kamil Khadiev, Aliya Khadieva |
Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
19 | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. |
ISAAC |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Kamil Khadiev |
On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
19 | Elizaveta A. Okol'nishnikova |
Comparing the sizes of nondeterministic branching read-k-times programs. |
Discret. Appl. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Jayram S. Thathachar |
On Separating the Read-k-Times Branching Program Hierarchy |
Electron. Colloquium Comput. Complex. |
1998 |
DBLP BibTeX RDF |
|
19 | Jayram S. Thathachar |
On Separating the Read-k-Times Branching Program Hierarchy. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Martin Sauerhoff |
A Lower Bound for Randomized Read-k-Times Branching Programs |
Electron. Colloquium Comput. Complex. |
1997 |
DBLP BibTeX RDF |
|
19 | Stasys Jukna |
The Graph of Integer Multiplication is Hard for Read-k-Times Networks |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
19 | Stasys Jukna |
A Note on Read-k Times Branching Programs. |
RAIRO Theor. Informatics Appl. |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Stasys Jukna |
A Note on Read-k Times Branching Programs |
Electron. Colloquium Comput. Complex. |
1994 |
DBLP BibTeX RDF |
|
19 | Allan Borodin, Alexander A. Razborov, Roman Smolensky |
On Lower Bounds for Read-K-Times Branching Programs. |
Comput. Complex. |
1993 |
DBLP DOI BibTeX RDF |
|
12 | Eldar Fischer, Ilan Newman |
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. |
CCC |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Stasys Jukna, Stanislav Zák |
On Branching Programs With Bounded Uncertainty (Extended Abstract). |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
7 | Elizaveta A. Okol'nishnikova |
On Some Bounds on the Size of Branching Programs (A Survey). |
SAGA |
2005 |
DBLP DOI BibTeX RDF |
|
7 | Jürgen Forster, Matthias Krause 0001, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon |
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
7 | Detlef Sieling |
A separation of syntactic and nonsyntactic (1, +k)-branching programs. |
Comput. Complex. |
2000 |
DBLP DOI BibTeX RDF |
nonsyntactic, lower bound, Branching program, syntactic |
7 | Detlef Sieling, Ingo Wegener |
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|