Polynomial identity testing via evaluation of rational functions

DOI10.4086/TOC.2024.V020A001MaRDI QIDQ6589604zbMATH OpenFDO

Authors Ivan Hu, Dieter Van Melkebeek, Andrew Morgan

Publication date 20 August 2024

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4086/TOC.2024.V020A001

zbMATH Keywords

derandomizationGröbner basislower boundspolynomial identity testingpseudorandomnessvanishing ideal

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Polynomial identity testing via evaluation of rational functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589604)