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
Powered by AI (Beta)
Loading...

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

Loading...

Content Warnings

Loading...