The following pages link to (Q5111163):
Displaying 8 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas (Q4973878) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs (Q5368905) (← links)
