scientific article; zbMATH DE number 7758310
From MaRDI portal
Publication:6084351
DOI10.4230/lipics.approx/random.2020.8MaRDI QIDQ6084351
Publication date: 31 October 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Quantified Derandomization: How to Find Water in the Ocean ⋮ On hitting-set generators for polynomials that vanish rarely
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministically testing sparse polynomial identities of unbounded degree
- Matching is as easy as matrix inversion
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- A probabilistic remark on algebraic program testing
- An infinite Sidon sequence
- Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
- Erratum: ``PRIMES is in P
- PRIMES is in P
- A complete annotated bibliography of work related to Sidon sequences
- Progress on Polynomial Identity Testing-II
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- Testers and their applications
- Arithmetic Circuits: A survey of recent results and open questions
- Proof verification and the hardness of approximation problems
- Primality and identity testing via Chinese remaindering
- Asymptotically Optimal Hitting Sets Against Polynomials
- Pseudorandom generators for low degree polynomials
- Improved Polynomial Identity Testing for Read-Once Formulas
- Progress on Polynomial Identity Testing - II
- Probabilistic checking of proofs
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Combinatorial Nullstellensatz
- Designing programs that check their work
- Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
- Bipartite Perfect Matching in Pseudo-Deterministic NC
- Randomness efficient identity testing of multivariate polynomials
- Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
- Identity testing and lower bounds for read- k oblivious algebraic branching programs
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
- The linear isometry group of the Gurarij space is universal
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Derandomizing polynomial identity tests means proving circuit lower bounds
This page was built for publication:
