OpenAlex
PricingAboutJobs
Log inGet started
Work

Turning machines with few accepting computations and low sets for PP

HTML

Year: 2003
Type: conference-paper
Source: Structure in Complexity Theory Annual Conference
DOI: 10.1109/sct.1989.41826
Authors: J. Kobler, U. Schoning, S. Toda, J. Toran
Institutions: University of Stuttgart, University of Electro-Communications, Universitat Politècnica de Catalunya
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: UP, few, PP, lowness, relativization, complexity classes, polynomial hierarchy

Open Access status: closed
OpenAlex ID: W2125536734
FWCI: 0.906
Cites: 22
Cited by: 34
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security