Sciweavers

7 search results - page 1 / 2
» istcs 1997
Sort
View
83
Voted
ISTCS
1997
Springer
15 years 4 months ago
Commutative Queries
Richard Beigel, Richard Chang
84
Voted
ISTCS
1997
Springer
15 years 4 months ago
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
Vladimir Grebinski, Gregory Kucherov
87
Voted
ISTCS
1997
Springer
15 years 4 months ago
Weak Alternating Automata Are Not That Weak
Orna Kupferman, Moshe Y. Vardi
106
Voted
ISTCS
1997
Springer
15 years 4 months ago
Faster subtree isomorphism
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
Ron Shamir, Dekel Tsur
154
Voted
ISTCS
1997
Springer
15 years 4 months ago
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
Gilles Brassard, Peter Høyer