Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Complexity and Approximation - In Memory of Ker-I Ko (Paperback, 1st ed. 2020)
Loot Price: R1,877
Discovery Miles 18 770
|
|
Complexity and Approximation - In Memory of Ker-I Ko (Paperback, 1st ed. 2020)
Series: Theoretical Computer Science and General Issues, 12000
Expected to ship within 10 - 15 working days
|
This Festschrift is in honor of Ker-I Ko, Professor in the Stony
Brook University, USA. Ker-I Ko was one of the founding fathers of
computational complexity over real numbers and analysis. He and
Harvey Friedman devised a theoretical model for real number
computations by extending the computation of Turing machines. He
contributed significantly to advancing the theory of structural
complexity, especially on polynomial-time isomorphism, instance
complexity, and relativization of polynomial-time hierarchy. Ker-I
also made many contributions to approximation algorithm theory of
combinatorial optimization problems. This volume contains 17
contributions in the area of complexity and approximation. Those
articles are authored by researchers over the world, including
North America, Europe and Asia. Most of them are co-authors,
colleagues, friends, and students of Ker-I Ko.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.