BPP and the polynomial hierarchy
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1983/11/01
-
Journal
-
Indian UGC (journal)
-
Refrences7
-
Citations67
-
Clemens Lautemann
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Telecommunication
Technology
Technology (General)
Industrial engineering
Management engineering
Information technology
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Some observations on the probabilistic algorithms and NP-hard problems | Information Processing Letters |
| 37 | 1982 |
| Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 | SIAM Journal on Computing |
| 164 | 1981 |
| Computational Complexity of Probabilistic Turing Machines | SIAM Journal on Computing |
| 262 | 1977 |
| Randomized algorithms | 1983 | |||
| The polynomial-time hierarchy | Theoretical Computer Science |
| 1977 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 7
is the most frequently represented among the references in this article. It primarily includes studies from SIAM Journal on Computing and Information Processing Letters. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Collision Resistance from Multi-collision Resistance | Journal of Cryptology |
| 2024 | |
IASCAR: Incremental Answer Set Counting by Anytime Refinement | Theory and Practice of Logic Programming |
| 2024 | |
Noisy Random Quantum Circuit Sampling and its Classical Simulation | Advanced Quantum Technologies |
| 2023 | |
| Computational advantage of quantum random sampling | Reviews of Modern Physics |
| 2023 | |
Toward Basing Cryptography on the Hardness of EXP | Communications of the ACM |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 47
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled The NP-completeness column: An ongoing guide and was published in 1984. The most recent citation comes from a 2024 study titled Collision Resistance from Multi-collision Resistance. This article reached its peak citation in 2023, with 4 citations. It has been cited in 27 different journals, 7% of which are open access. Among related journals, the SIAM Journal on Computing cited this research the most, with 9 citations. The chart below illustrates the annual citation trends for this article.