Scott Aaronson  Home/Search
Context
Related
| berkeley.edu/~aaronson/bfpsiam.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~aaronson...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for example, deterministic, randomized, and quantum query complexities (Update)
Active bibliography (related documents): More All
0.4: Complexity Measures and Decision Tree Complexity: A Survey - Buhrman, de Wolf (2000) (Correct)
0.3: Quantum Lower Bounds by Polynomials - Robert Beals University (Correct)
0.3: quant-ph/9802049 - Sep Quantum Lower (Correct)
Similar documents based on text: More All
0.8: Sensitivity, Block Sensitivity, and l-Block Sensitivity of.. - Kenyon, Kutin (Correct)
0.4: Quantum Certificate Complexity - Aaronson (Correct)
0.4: Average-Case Quantum Query Complexity - Ambainis, de Wolf (2000) (Correct)
BibTeX entry: (Update)
@misc{ on-algorithms,
author = "Scott Aaronson",
title = "Algorithms For Boolean Function Query Properties",
url = "citeseer.ist.psu.edu/533008.html" }
Citations (may not include all citations):210 A fast quantum mechanical algorithm for database search - Grover - 1996
173 Quantum complexity theory - Bernstein, Vazirani - 1997
94 Constructing optimal binary decision trees is NP-complete (context) - Hyafil, Rivest - 1976
61 Natural proofs - Razborov, Rudich - 1997
57 the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
49 Quantum lower bounds by polynomials - Beals, Buhrman et al. - 1998
44 CREW PRAMs and decision trees (context) - Nisan - 1991
32 Quantum computations: algorithms and error correction (context) - Yu - 1997
29 Probabilistic Boolean decision trees and the complexity of e.. (context) - Saks, Wigderson - 1986
17 Complexity measures and decision tree complexity: a survey - Buhrman, de Wolf
17 Lower bounds on learning decision lists and trees (context) - Hancock, Jiang et al. - 1996
16 Quantum lower bounds by quantum arguments - Ambainis - 2000
11 the Monte Carlo decision tree complexity of read-once formul.. (context) - Santha - 1995
8 Linear Algebra (context) - Ho, Kunze - 1971
6 Sampling algorithms: lower bounds and applications (context) - Bar-Yossef, Kumar et al. - 2001
5 Quantum oracle interrogation: getting all the information fo.. - van Dam - 1998
3 Average-case quantum query complexity - Ambainis, de Wolf - 2000
3 The complexity of minimizing disjunctive normal form formula.. - Czort - 1999
3 Exact learning when irrelevant variables abound - Guijarro, in et al. - 1999
1 talk at workshop on Mathematics of Quantum Computation (context) - Solovay, groups et al. - 2000
1 Boolean Function Wizard (context) - Aaronson - 2000
Documents on the same site (http://www.cs.berkeley.edu/~aaronson/research.html): More
Quantum Computing and Dynamical Quantum Models - Aaronson (Correct)
BOOK REVIEW on A New Kind of Science by Stephen Wolfram Wolfram - Aaronson (2001) (Correct)
Quantum Lower Bound for the Collision Problem - Aaronson (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC