The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Amplification of slight probabilistic advantage at absolutely no cost in space
Information Processing Letters
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Tally Languages Accepted by Monte Carlo Pushdown Automata
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
On the Power of Randomized Pushdown Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
A Separation of Determinism, Las Vegas and Nondeterminism for Picture Recognition
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the Structure of Log-Space Probabilistic Complexity Classes
On the Structure of Log-Space Probabilistic Complexity Classes
Properties of Probabilistic Pushdown Automata
Properties of Probabilistic Pushdown Automata
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
One-way two-counter machines represent a universal model of computation. Here we consider the polynomial-time classes of multicounter machines with a constant number of reversals and separate the computational power of nondeterminism, randomization and determinism. For instance, we show that polynomial-time one-way multicounter machines, with error probability tending to zero with growing input length, can recognize languages that cannot be accepted by polynomial-time nondeterministic two-way multicounter machines with a bounded number of reversals. A similar result holds for the comparison of determinism and one-sided-error randomization, and of determinism and Las Vegas randomization.