Work

Counting Random Oracles for the Polynomial-Time Hierarchy and Quantum Complexity Classes

Year: 2026

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-032-31348-5_22

Authors: John M. Hitchcock, Adewale Sekoni, Hadi Shafei

Institutions: University of Wyoming, Roanoke College, University of Huddersfield

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W7169727113

FWCI:

Cites: 39

Cited by:

Related to: 10