Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Koucký, Michal - Institute of Mathematics, Academy of Sciences of the Czech Republic
Boundeddepth Circuits: Separating Wires from Gates (Extended Abstract)
Circuit complexity of regular languages Michal Koucky #
ON TRAVERSAL SEQUENCES, EXPLORATION SEQUENCES AND COMPLETENESS OF
On Traversal and Exploration Sequences Michal Koucky #
Power from Random Strings Eric Allender # Harry Buhrman + Michal Koucky #
Universal Traversal Sequences with Backtracking Michal Koucky #
Circuit Lower Bounds via EhrenfeuchtFra ss e Games Michal Koucky
TimeSpace Tradeoffs in the Counting Hierarchy ERIC ALLENDER #
Logspace Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03 )
Languages with Bounded Multiparty Communication Complexity #
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Matematicko-fyzikln fakulta Univerzity Karlovy v Praze
A new characterization of ACC0 and probabilistic CC0
Pseudorandom Generators for Group Products preliminary version
Winning concurrent reachability games requires doubly-exponential patience Kristoffer Arnsfelt Hansen
Randomised Individual Communication Complexity Harry Buhrman
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
Derandomizing from Random Strings Harry Buhrman
Amplifying Lower Bounds by Means of Self-Reducibility Eric Allender
What Can be Eciently Reduced to the K-random Strings? Eric Allender
Many Random Walks Are Faster Than One Tel Aviv University
