8 search results - page 1 / 2 » Alternating Hierarchies for Time-Space Tradeoffs |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
JCSS
2000
13 years 4 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Modern CPUs operate at GHz frequencies, but the latencies of memory accesses are still relatively large, in the order of hundreds of cycles. Deeper cache hierarchies with large...