Improved Explicit Hitting-Sets for ROABPs
From MaRDI portal
Cites work
- A probabilistic remark on algebraic program testing
- Arithmetic circuits: a survey of recent results and open questions
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Deterministic polynomial identity testing in non-commutative models
- Diagonal Circuit Identity Testing and Lower Bounds
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Hitting sets with near-optimal error for read-once branching programs
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
- On recycling the randomness of states in space bounded computation
- Progress on polynomial identity testing
- Progress on polynomial identity testing. II
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- Quasi-polynomial hitting-set for set-depth-\({\Delta}\) formulas
- Towards blackbox identity testing of log-variate circuits
- Universal classes of hash functions
Cited in
(8)- Blackbox identity testing for sum of special ROABPs and its border class
- Improved hitting set for orbit of ROABPs
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- Lower bounds for set-multilinear branching programs
- Tensor reconstruction beyond constant rank
- Derandomizing multivariate polynomial factoring for low degree factors
- Hitting sets for orbits of circuit classes and polynomial families
- Faster \& deterministic FPT algorithm for worst-case tensor decomposition
This page was built for publication: Improved Explicit Hitting-Sets for ROABPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084347)
