11 search results - page 3 / 3 » Improved simulation of nondeterministic Turing machines |
92
Voted
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...