MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Randomized Branching Programs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

26 documents found, showing 1 through 10. Next 10 →

ATOM

On the Power of Randomized Branching Programs
by Farid Ablayev , Marek Karpinski — 1996 — IN PROCEEDINGS OF THE ICALP'96, LECTURE NOTES IN COMPUTER SCIENCE
…On the Power of Randomized Branching Programs Farid Ablayev Marek Karpinski y Abstract We…
Cited by 19 (9 self) – Add To MetaCart

On the Computation Power of Randomized Branching Programs
by Marek Karpins Ki — 1996 — in Proceedings of the ICALP'96, Lecture Notes in Computer Science
…On the Computation Power of Randomized Branching Programs Marek Karpinski Abstract. We survey…
Add To MetaCart

Complexity Theoretical Results for Randomized Branching Programs
by Martin Sauerhoff — 1998
…Complexity Theoretical Results for Randomized Branching Programs Dissertation zur Erlangung des…
Cited by 8 (7 self) – Add To MetaCart

On the Power of Randomized Ordered Branching Programs
by Farid Ablayev, Marek Karpinski — 1997
…On the Power of Randomized Ordered Branching Programs DRAFT Farid Ablayev Marek Karpinski y…
Cited by 6 (1 self) – Add To MetaCart

On Nondeterminism versus Randomness for Read-Once Branching Programs
by Martin Sauerhoff — 1997 — Electronic Colloquium on Computational Complexity
…On Nondeterminism versus Randomness for Read-Once Branching Programs Martin Sauerhoff FB…
Cited by 4 (1 self) – Add To MetaCart

A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
by Farid Ablayev , Marek Karpinski — 1998
…A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs Farid Ablayev…
Cited by 5 (4 self) – Add To MetaCart

A Lower Bound for Integer Multiplication on Randomized Ordered Read-Once Branching Programs
by Farid Ablayev, Marek Karpinski — 1998 — Information and Computation
…A Lower Bound for Integer Multiplication on Randomized Ordered Read-Once Branching Programs Farid…
Cited by 4 (1 self) – Add To MetaCart

A Lower Bound for Randomized Read-k-Times Branching Programs
by Martin Sauerhoff — 1997 — Electr. Coll. on Comp. Compl
…A Lower Bound for Randomized Read-k-Times Branching Programs Martin Sauerhoff FB Informatik, LS…
Cited by 13 (7 self) – Add To MetaCart

Structure and Complexity
by Uwe Schoning (universitat Ulm, Uwe Schöning, Klaus W. Wagner, Klaus W. Wagner (universitat Wurzburg, Farid Ablayev, Eric Allender, Bernd Borchert, Harry Buhrman, Stephen Fenner, Lance Fortnow, Judy Goldsmith, Ulrich Hertrampf, Klaus-jorn Lange — 1996
…, oneway functions, and computational models. PROGRAM Farid Ablayev On the Power of Randomized Branching…
Add To MetaCart

Randomization and Nondeterminsm Are Incomparable for Ordered Read-Once Branching Programs
by Farid Ablayev — 1997
… n can be computed by polynomial size randomized ordered readonce branching program with one sided…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB