Books > Computing & IT > General theory of computing
|
Buy Now
Testing Polynomial Identities with Fewer Random Bits (Paperback)
Loot Price: R1,276
Discovery Miles 12 760
|
|
Testing Polynomial Identities with Fewer Random Bits (Paperback)
Expected to ship within 10 - 15 working days
|
Testing if a multivariate polynomial given as an arithmetic circuit
is identically zero is a fundamental problem in the theory of
computation. It has been studied by computer scientists and
mathematicians for about thirty years. From early on, there have
been efficient randomized algorithms solving the problem. However,
designing efficient algorithms that use fewer or no random bits at
all has turned into a notorious open problem over the years. By
now, it is understood that a deterministic algorithm for general
arithmetic circuits would have major consequences in theoretical
computer science. To approach this goal, it is worthwhile to
understand the randomness complexity of polynomial identity testing
in restricted models. In this book, we consider some natural and
well-studied models in which we obtain new results.
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!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.