OpenAlex
PricingAboutJobs
Log inGet started
Work

Transparent Proofs and Limits to Approximation

HTML

Year: 1994
Type: book-chapter
Source: Birkhäuser Basel eBooks
Parent work: First European Congress of Mathematics: Paris, July 6-10, 1992 Volume I Invited Lectures (Part 1)
DOI: 10.1007/978-3-0348-9110-3_2
Author: László Babai
Institutions: Eötvös Loránd University, University of Chicago
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: interactive proofs, proof verification, proof length, Zermelo-Fraenkel set theory, discrete optimization, hardness of approximation, P = NP, computational complexity

Open Access status: closed
OpenAlex ID: W192146155
FWCI: 12.82
Cites: 142
Cited by: 29
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