The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Complexity measures and decision tree complexity: a survey
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Concrete Mathematics: A Foundation for Computer Science
Graham, R. L., Knuth, D. E., Patashnik, O., & Liu, S. (1989) · Computers in Physics · doi:10.1063/1.4822863 · Cited by 2,407
Concrete Mathematics: A Foundation for Computer Science.
Bender, E. A., Graham, R. L., Knuth, D. E., & Patashnik, O. (1991) · The American Mathematical Monthly · doi:10.2307/2324448 · Cited by 1,368
The Complexity of Boolean Functions
Wegener, I. (1987) · Cited by 882
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Self-citationThe influence of variables on Boolean functions
Kahn, J., Kalai, G., & Linial, N. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21923 · Cited by 620
On the degree of boolean functions as real polynomials
Nisan, N., & Szegedy, M. (1994) · Computational Complexity · doi:10.1007/bf01263419 · Cited by 384
Probabilistic Boolean decision trees and the complexity of evaluating game trees
Saks, M., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.44 · Cited by 216
Cited by
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Self-citationImproved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Gall, F. L. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.31 · Cited by 56
Quantum proofs for classical theorems
(2011) · Theory of Computing · doi:10.4086/toc.gs.2011.002 · Cited by 41
Self-citation
Metadata
- Authors
- Buhrman, H., & de Wolf, R.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2002-10
- Volume
- 288
- Issue
- 1
- Pages
- 21-43
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2012496360
- Cited by
- 665
- References
- 44
- FWCI
- 21.25
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Complexity measures and decision tree complexity: a survey. https://app.cochat.ai/papers/10.1016/s0304-3975(01)00144-x
- The paper
- Buhrman, H., & de Wolf, R. (2002). Complexity measures and decision tree complexity: a survey. Theoretical Computer Science. https://doi.org/10.1016/s0304-3975(01)00144-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.