Abstract: Starting with Cook's pioneering work on NP-completeness in 1970, polynomial complexity theory, the study of polynomial-time com putability, has quickly emerged as the new foundation of algorithms. On
Publication Year: 1991
Publication Date: 1991-01-01
Language: en
Type: book
Indexed In: ['crossref']
Access and Citation
Cited By Count: 553
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot