On relativizations with restricted number of accesses to the oracle set

DOI10.1007/BF01692055zbMath0638.68030MaRDI QIDQ3779739

Marius Zimand

Publication date: 1988

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexityTuring machineoraclerelativized classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Qualitative relativizations of complexity classes
• Relative complexity of checking and evaluating
• Positive Relativizations of Complexity Classes
• Quantitative Relativizations of Complexity Classes
• Lowness Properties of Sets in the Exponential-Time Hierarchy
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

This page was built for publication: On relativizations with restricted number of accesses to the oracle set