CiteSeerX — Computation Power of Randomization and Nondeterminism

Computation Power of Randomization and Nondeterminism

Cached

Download Links

[www.ite.ethz.ch]

by Unknown Authors

BibTeX

@MISC{_computationpower,
    author = {},
    title = {Computation Power of Randomization and Nondeterminism},
    year = {}
}

Bookmark

OpenURL

Abstract

2 Scientific Work

Citations

1950	Computational complexity - Papadimitriou - 1994
536	Communication complexity - Kushilevitz, Nisan - 1997
135	Branching Programs and Binary Decision Diagrams—Theory and Applications - Wegener - 2000
97	Multi-Party protocols - CHANDRA, FURST, et al.
68	Wigderson: Monotone Circuits for Matching Require Linear Depth - Raz, A
49	On lower bounds for read-k-times branching programs - Borodin, Razborov, et al. - 1993
34	Las Vegas is better than determinism - Mehlhorn, Schmidt - 1982
28	On notions of information transfer in VLSI circuits - Aho, Ullman, et al. - 1983
10	D.: On measuring nondeterminism in regular languages - Goldstine, Kintala, et al. - 1990
9	Complexity Theoretical Results for Randomized Branching Programs - Sauerhoff - 1999
8	On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata - Hromkovič, Schnitger
6	Exact lower bounds for computing Boolean functions onCREW PRAMs - Dietzfelbinger, lowski, et al. - 1994
6	M.: Tradeoffs between nondeterminism and complexity for communication protocols and branching programs - Hromkovič, Sauerhoff
4	Relation between Chomsky Hierarchy and Communication Complexity Hierarchy - Hromkovic - 1986
3	Communication Protocols – an exemplary study of the power of randomness - Hromkovič - 1996
3	On the power of Las Vegas II: two-way finite automata - Hromkovič, Schnitger
3	Private versus common random bits in communication complexity. Information Processing Letters, 39:67–71 - Newman - 1991
2	On multi-partition communication complexity - Duriˇs, Jukna, et al.
2	Nondeterminism versus determinism for two-way finite automata: Generalizations of Sipser’s separation - Hromkovič, Schnitger
1	Skalikova A. N.: Lower bounds on the area complexity of Boolean circuits - Hromkovič, Loˇzkin, et al. - 1992
1	Fooling a two-way nondeterministic automaton with reversal number restriction - Hromkovič - 1985
1	Communication Complexity hierarchy. Theoretical Computer Science 48 - Hromkovič - 1986
1	The advantages of a new approach to defining the communication complexity of VLSI - Hromkovič - 1998
1	Tradeoffs for language recognition on alternating machines - Hromkovič - 1989
1	Nonlinear lower bounds on the number of processors of circuits with sublinear separators - Hromkovič - 1991
1	Reversals-space-parallelismtradeoffs for language recognition. Mathematica Slovaca - Hromkovič - 1991
1	Beijing World Publishing Corporation 2000, special edition for People’s Republic of China.) Hromkovič, J.: Communication complexity and lower bounds on multilective computations - Springer - 1997
1	G.: Communication complexity and sequential computations - Hromkovič, Schnitger - 1997
1	Wolfgang-Goethe Universität Frankfurt am Main, (2000). [In German ] Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require superlogarithmic depth - Dissertation - 1988
1	Amplification of Slight Probabilistic Advantage at Absolutely No Cost - Macarie, Seiferas - 1999
1	Lower bounds for synchronous circuits and planar circuits - Turán - 1989