Testing Polynomial Identities with Fewer Random Bits by Moritz Hardt

Testing Polynomial Identities with Fewer Random Bits

Moritz Hardt

52 pages missing pub info (editions)

nonfiction computer science science medium-paced

Description

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, the...

Read more

Community reviews

This book doesn't have any reviews or ratings yet!

If you've read it, mark it as 'read' and add a review to help others in the StoryGraph community figure out if it might be a book for them!

Content Warnings

This book doesn't have any content warnings yet!

If you're the author of this book and want to add author-approved content warnings, please email us at [email protected] to request the content warning form.