OpenAlex
PricingAboutJobs
Log inGet started
Work

The Complexity of Computations

HTML

Year: 2013
Type: book-chapter
Source: Springer monographs in mathematics
Parent work: Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction
DOI: 10.1007/978-3-319-00119-7_5
Author: Pavel Pudlák
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: computational complexity theory, time complexity, space complexity, Boolean circuits, randomized computation, interactive computing, parallel computing, quantum circuits, Shor's algorithm, integer factorization, foundations of mathematics

Open Access status: closed
OpenAlex ID: W59112699
FWCI: 16.03
Cites: 60
Cited by: 60
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