Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COCO
1990
Springer

favoriteEmaildiscussreport

84views Algorithms» more COCO 1990»

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

13 years 9 months ago

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

Download www.cs.umd.edu

Amihood Amir, Richard Beigel, William I. Gasarch

Real-time Traffic

Algorithms | COCO 1990 |

claim paper

Related Content

» NonUniform Reductions

» Property Testing Lower Bounds via Communication Complexity

» Algebrization A New Barrier in Complexity Theory

» Space Complexity vs Query Complexity

» Lower bounds for dynamic connectivity

» The Space Complexity of Processing XML Twig Queries Over Indexed Documents

» Epsilon nets and union complexity

» Testing Convexity Properties of Tree Colorings

» Boosting Spectral Partitioning by Sampling and Iteration

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1990
Where	COCO
Authors	Amihood Amir, Richard Beigel, William I. Gasarch

Comments (0)