Have a personal or library account? Click
here
to login
Paradigm
reference-global.com
Content
Services
Paradigm
Partners
Contact
Books
Hardness of Approximation Between P and NP
Hardness of Approximation Between P and NP
Publisher:
Association for Computing Machinery
By:
Rubinstein Aviad
Paid access
|
Jun 2019
Product purchase options
E-Book
€69.00
Institutions
€207.00
Product purchase options
E-Book
€69.00
Institutions
€207.00
Loading...
Authors
Aviad, Rubinstein
reference-global.com
Google Scholar
Loading...
PDF ISBN:
978-1-947487-21-5
|
E-Pub ISBN:
978-1-947487-22-2
Publisher:
Association for Computing Machinery
Copyright owner:
© 2019 Association for Computing Machinery
Publication date:
2019
Language:
English
Pages:
319
Related subjects:
Computer sciences
,
Computer sciences, other
People also read
Publications carousel
Previous slide
Next slide
Book
On Monotonicity Testing and the 2-to-2 Games Conjecture
Minzer Dor
Book
Analysis and Design of Algorithms- A Beginner's Hope
Shefali Singhal
Book
Theory of Computation Simplified
Dr. Varsha H. Patil
,
Dr. Aboli H. Patil
,
Dr. Vaishali S. Pawar
,
Dr. Swati A. Bhavsar
Book
Artificial Intelligence and Natural Algorithms
Rijwan Khan
,
Santosh Kumar
,
Pawan Kumar Sharma
,
Sugam Sharma
Book
Dominant Algorithms to Evaluate Artificial Intelligence: From the view of Throughput Model
Waymond Rodgers
Book
Artificial Intelligence Problems and Their Solutions
Danny Kopec
,
Shweta Shetty
,
Christopher Pileggi
Book
Artificial Intelligence: Models Algorithms and Applications
Terje Solsvik Kristensen
Book
Algorithmic Commonplaces
Thomas VanDrunen
Book
A Practitioner's Approach for Problem-Solving using AI
Satvik Vats
,
Satya Prakash Yadav
,
Vikrant Sharma
,
Dibyahash Bordoloi
Book
Indistinguishability Obfuscation from Well-Studied Assumptions
Aayush Jain