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
Description
Authors
Metrics
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
Dor, Minzer
Book
Analysis and Design of Algorithms- A Beginner's Hope
Singhal, Shefali
Book
Theory of Computation Simplified
H. Patil, Dr. Varsha
,
H. Patil, Dr. Aboli
,
S. Pawar, Dr. Vaishali
,
A. Bhavsar, Dr. Swati
Book
Artificial Intelligence and Natural Algorithms
Khan, Rijwan
,
Kumar, Santosh
,
Sharma, Pawan Kumar
,
Sharma, Sugam
Book
Dominant Algorithms to Evaluate Artificial Intelligence: From the view of Throughput Model
Rodgers, Waymond
Book
Artificial Intelligence Problems and Their Solutions
Kopec, Danny
,
Shetty, Shweta
,
Pileggi, Christopher
Book
Artificial Intelligence: Models Algorithms and Applications
Kristensen, Terje Solsvik
Book
Algorithmic Commonplaces
VanDrunen, Thomas
Book
A Practitioner's Approach for Problem-Solving using AI
Vats, Satvik
,
Prakash Yadav, Satya
,
Sharma, Vikrant
,
Bordoloi, Dibyahash
Book
Artificial Intelligence and Problem Solving
Kopec, Danny
,
Shetty, Shweta
,
Pileggi, Christopher
,
Ungar, David