Sciweavers

7 search results - page 1 / 2

» istcs 1997

11

ISTCS
1997
Springer

254views Applied Computing» more ISTCS 1997»

Commutative Queries

13 years 8 months ago

Commutative Queries

Download www.cis.temple.edu

Richard Beigel, Richard Chang

claim paper

Read More »

15

ISTCS
1997
Springer

220views Applied Computing» more ISTCS 1997»

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

13 years 8 months ago

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

Download www.lifl.fr

Vladimir Grebinski, Gregory Kucherov

claim paper

Read More »

15

ISTCS
1997
Springer

213views Applied Computing» more ISTCS 1997»

Weak Alternating Automata Are Not That Weak

13 years 8 months ago

Weak Alternating Automata Are Not That Weak

Download www.inf.ethz.ch

Orna Kupferman, Moshe Y. Vardi

claim paper

Read More »

18

ISTCS
1997
Springer

278views Applied Computing» more ISTCS 1997»

Faster subtree isomorphism

13 years 8 months ago

Faster subtree isomorphism

Download www.cs.bgu.ac.il

We study the subtree isomorphism problem: Given trees H and G, ﬁnd a subtree of G which is isomorphic to H or decide that there is no

Ron Shamir, Dekel Tsur

claim paper

Read More »

30

ISTCS
1997
Springer

289views Applied Computing» more ISTCS 1997»

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

13 years 8 months ago

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

Download pages.cpsc.ucalgary.ca

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

claim paper

Read More »

« Prev « First page 1 / 2 Last » Next »