scientific article; zbMATH DE number 7204283
From MaRDI portal
Publication:5111163
Recommendations
- Complete derandomization of identity testing and reconstruction of read-once formulas
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Identity testing for constant-width, and commutative, read-once oblivious ABPs
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Building above read-once polynomials: identity testing and hardness of representation
- Building above read-once polynomials: identity testing and hardness of representation
- Read-once polynomial identity testing
- Read-once polynomial identity testing
Cited in
(11)- Complete derandomization of identity testing and reconstruction of read-once formulas
- Improved Polynomial Identity Testing for Read-Once Formulas
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Read-once polynomial identity testing
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
- On some computations on sparse polynomials
- Isomorphism testing of read-once functions and polynomials
- Random arithmetic formulas can be reconstructed efficiently
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- On reconstruction and testing of read-once formulas
- Improved hitting set for orbit of ROABPs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111163)
