Hitting sets for multilinear read-once algebraic branching programs, in any order

DOI10.1145/2591796.2591816zbMath1315.68127OpenAlexW2064885856MaRDI QIDQ5259623

Ramprasad Saptharishi, Amir Shpilka, Michael A. Forbes

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

derandomizationread-once branching programspolynomial identity testing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items

Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Higgledy-piggledy subspaces and uniform subspace designs ⋮ Deterministic Truncation of Linear Matroids ⋮ Subexponential size hitting sets for bounded depth multilinear formulas ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Read-once polynomial identity testing ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Unnamed Item ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography