Complexity classes and sparse oracles
From MaRDI portal
Publication:1894447
DOI10.1006/jcss.1995.1030zbMath0837.68027OpenAlexW1993576444MaRDI QIDQ1894447
Pierluigi Crescenzi, Daniel P. Bovet, Riccardo Silvestri
Publication date: 24 July 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1995.1030
Related Items (9)
A characterization of the leaf language classes ⋮ On balanced versus unbalanced computation trees ⋮ Separating complexity classes with tally oracles ⋮ Succinct circuit representations and leaf language classes are basically the same concept ⋮ On the acceptance power of regular languages ⋮ Helping by unambiguous computation and probabilistic computation ⋮ A uniform approach to define complexity classes ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties ⋮ Succinct representation, leaf languages, and projection reductions
This page was built for publication: Complexity classes and sparse oracles
