SWAT
2000
Springer
14 years 1 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
SWAT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
STOC
2000
ACM
2000
ACM
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
14 years 1 months ago
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
STOC
2000
ACM
14 years 1 months ago
2000
ACM
COCO
1995
Springer
14 years 1 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
COCO
1995
Springer
14 years 1 months ago
1995
Springer
COCO
1995
Springer
14 years 1 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
COCO
1995
Springer
14 years 1 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...