On closure properties of Read-once oblivious algebraic branching programs
From MaRDI portal
Cites work
- A convolution for complete and elementary symmetric functions
- Blackbox identity testing for sum of special ROABPs and its border class
- Chebotarëv and his density theorem
- Closure results for polynomial factorization
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Constant-depth arithmetic circuits for linear algebra problems
- Demystifying the border of depth-3 algebraic circuits
- Depth-3 arithmetic circuits over fields of characteristic zero
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Deterministic polynomial identity testing in non-commutative models
- Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
- Expander graphs and their applications
- Expanders and time-restricted branching programs
- Explicit commutative ROABPs from partial derivatives
- Explicit construction of linear sized tolerant networks. (Reprint)
- Factoring sparse multivariate polynomials
- Factorization of polynomials given by arithmetic branching programs
- Hardness-randomness tradeoffs for bounded depth arithmetic circuits
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Hitting sets for orbits of circuit classes and polynomial families
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- scientific article; zbMATH DE number 1261803 (Why is no real title available?)
- scientific article; zbMATH DE number 7471587 (Why is no real title available?)
- scientific article; zbMATH DE number 7561749 (Why is no real title available?)
- scientific article; zbMATH DE number 3046871 (Why is no real title available?)
- scientific article; zbMATH DE number 3049222 (Why is no real title available?)
- scientific article; zbMATH DE number 7711611 (Why is no real title available?)
- Identity testing and lower bounds for read-\(k\) oblivious algebraic branching programs
- Improved Explicit Hitting-Sets for ROABPs
- Improved hitting set for orbit of ROABPs
- Improved lower bound, and proof barrier, for constant depth algebraic circuits
- Modern computer algebra
- On finer separations between subclasses of read-once oblivious ABPs
- On the complexity of symmetric polynomials
- Polynomials whose powers are sparse
- Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs
- Separated borders: exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits
- Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits
- Superpolynomial lower bounds against low-depth algebraic circuits
- The Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
- Using algebraic geometry
This page was built for publication: On closure properties of Read-once oblivious algebraic branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445517)