OpenAlex
PricingAboutJobs
Log inGet started
Work

Parallel Algorithms for NP-Complete Problems

HTML

Year: 1992
Type: book-chapter
Source: Springer eBooks
Parent work: Computer Science: Research and Applications
DOI: 10.1007/978-1-4615-3422-8_31
Author: J. M. Robson
Institution: Australian National University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: NP-complete problems, parallel algorithms, computational intractability, exponential-time algorithms, subexponential algorithms, parallel machines, combinatorial search

Open Access status: closed
OpenAlex ID: W68452509
FWCI:
Cites: 8
Cited by: 1
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security