Sciweavers

Share
FOCS
1997
IEEE
10 years 1 months ago
Satisfiability Coding Lemma
Ramamohan Paturi, Pavel Pudlák, Francis Zan...
FOCS
1997
IEEE
10 years 1 months ago
Making Nondeterminism Unambiguous
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...
Klaus Reinhardt, Eric Allender
FOCS
1997
IEEE
10 years 1 months ago
On the Power of Quantum Finite State Automata
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...
Attila Kondacs, John Watrous
FOCS
1997
IEEE
10 years 1 months ago
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
Eyal Kushilevitz, Rafail Ostrovsky
FOCS
1997
IEEE
10 years 1 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
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...
Pascal Koiran
FOCS
1997
IEEE
10 years 1 months ago
Storage Management for Evolving Databases
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...
Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghav...
FOCS
1997
IEEE
10 years 1 months ago
The Computational Complexity of Knot and Link Problems
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...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
books