FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
FOCS
1997
IEEE
13 years 8 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...