13603 search results - page 324 / 2721 » On the Computational Complexity of Cut-Reduction |
187
click to vote
FCT
2001
Springer
15 years 12 months ago
2001
Springer
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
176
Voted
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
172
Voted
SPAA
2006
ACM
16 years 1 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
231
Voted
APNOMS
2009
Springer
15 years 5 months ago
2009
Springer
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
208
Voted
ICIP
2008
IEEE
16 years 9 months ago
2008
IEEE
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...