Sciweavers

7 search results - page 2 / 2
» A note on dimensions of polynomial size circuits
Sort
View
CSL
2010
Springer
13 years 5 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 7 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou