The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Nondeterminism within $P^ * $
Abstract
Classes of machines using very limited amounts of nondeterminism are studied. The $P = ?NP$ question is related to questions about classes lying within P. Complete sets for these classes are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gurevich, Y. G., & Shelah, S. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51237-3_10 · Cited by 94
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
Kintala, C. M. R., & Fischer, P. C. (1980) · SIAM Journal on Computing · doi:10.1137/0209003 · Cited by 82
Satisfiability Is Quasilinear Complete in NQL
Schnorr, C. P. (1978) · Journal of the ACM · doi:10.1145/322047.322060 · Cited by 82
Short propositional formulas represent nondeterministic computations
Cook, S. A. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90152-4 · Cited by 73
Relativized alternation and space-bounded computation
Buss, J. F. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90034-7 · Cited by 36
Self-citationThe Complexity of Very Simple Boolean Formulas with Applications
Hunt, H. B., & Stearns, R. E. (1990) · SIAM Journal on Computing · doi:10.1137/0219003 · Cited by 28
Complexity classes with complete problems between P and NP-C
Àlvarez, C., Dı́az, J., & Torán, J. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51498-8_2 · Cited by 14
Cited by
Invitation to Fixed-Parameter Algorithms
Niedermeier, R. (2006) · doi:10.1093/acprof:oso/9780198566076.001.0001 · Cited by 1,668
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Fixed-Parameter Tractability and Completeness I: Basic Results
Downey, R. G., & Fellows, M. R. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792228228 · Cited by 468
Coherence as constraint satisfaction
Thagard, P. (1998) · Cognitive Science · doi:10.1016/s0364-0213(99)80033-0 · Cited by 352
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
Williams, R. (2013) · SIAM Journal on Computing · doi:10.1137/10080703x · Cited by 157
Metadata
- Authors
- Buss, J. F., & Goldsmith, J.
- Venue
- SIAM Journal on Computing
- Published
- 1993-06
- Volume
- 22
- Issue
- 3
- Pages
- 560-572
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1973852671
- Cited by
- 308
- References
- 7
- FWCI
- 7.03
- Type
- journal article
- Language
- en
- Open access
- closed
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: Nondeterminism within $P^ * $. https://app.cochat.ai/papers/10.1137/0222038
- The paper
- Buss, J. F., & Goldsmith, J. (1993). Nondeterminism within $P^ * $. SIAM Journal on Computing. https://doi.org/10.1137/0222038
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.