OpenAlex
PricingAboutJobs
Log inGet started
Work

Twenty questions to a p-selector

HTML

Year: 1993
Type: article
Source: Information Processing Letters
DOI: 10.1016/0020-0190(93)90146-z
Authors: Harry Buhrman, Leen Torenvliet, Peter van Emde Boas
Institution: University of Amsterdam
Language: English

Topic: Computability, Logic, AI Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: P-selective sets, Turing reducibility, many-one reducibility, polynomial-time computability, complexity classes

Open Access status: closed
OpenAlex ID: W2013374562
FWCI: 3.409
Cites: 11
Cited by: 16
Related to: 9
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security