Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas

From MaRDI portal

Revision as of 08:59, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4973878

Jump to:navigation, search

DOI10.1145/3196836zbMath1427.68363OpenAlexW2803234806WikidataQ129804692 ScholiaQ129804692MaRDI QIDQ4973878

Daniel Minahan, Ilya Volkovich

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3196836

zbMATH Keywords

derandomization arithmetic circuit identity testing circuit reconstruction arithmetic formula

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20)

Related Items (2)

A note on parameterized polynomial identity testing using hitting set generators ⋮ Limitations of sums of bounded read formulas and ABPs

This page was built for publication: Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4973878&oldid=19405620"