Search Sciweavers | Sciweavers

3341 search results - page 65 / 669

» On Bounded Queries and Approximation

107

click to vote

APPROX
2005
Springer

104views Algorithms» more APPROX 2005»

Bounds for Error Reduction with Few Quantum Queries

15 years 10 months ago

Download people.cs.uchicago.edu

We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a

Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...

claim paper

Read More »

119

click to vote

COCO
1990
Springer

84views Algorithms» more COCO 1990»

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

15 years 9 months ago

Download www.cs.umd.edu

Amihood Amir, Richard Beigel, William I. Gasarch

claim paper

Read More »

click to vote

COMPGEOM
2007
ACM

82views Discrete Geometry» more COMPGEOM 2007»

Tight bounds for dynamic convex hull queries (again)

15 years 9 months ago

Download people.csail.mit.edu

Erik D. Demaine, Mihai Patrascu

claim paper

Read More »

123

click to vote

COCO
2010
Springer

146views Algorithms» more COCO 2010»

The Partition Bound for Classical Communication Complexity and Query Complexity

15 years 9 months ago

Download www.comp.nus.edu.sg

Rahul Jain, Hartmut Klauck

claim paper

Read More »

134

click to vote

ISTCS
1997
Springer

220views Applied Computing» more ISTCS 1997»

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

15 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers