Fast Probabilistic Algorithms for Verification of Polynomial Identities
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- Maximal bilinear complexity and codes
- On the security of functional encryption in the generic group model
- More efficient shuffle argument from unique factorization
- The key-dependent message security of key-alternating Feistel ciphers
- Revisiting the parameterized complexity of maximum-duo preservation string mapping
- New ideas to build noise-free homomorphic cryptosystems
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Improved distance queries and cycle counting by Frobenius normal form
- On binary solutions to systems of equations
- Characterizing propositional proofs as noncommutative formulas
- Interrogating witnesses for geometric constraint solving
- Towards identity testing for sums of products of Read-once and multilinear bounded-Read formulae
- Bell's Primeness Criterion for W(2n + 1)
- Extractors for varieties
- Polynomial modular product verification and its implications
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- Exact matching: correct parity and FPT parameterized by independence number
- Dominator coloring and CD coloring in almost cluster graphs
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Attribute-Based Broadcast Encryption Scheme Made Efficient
- On additive-nilpotency of Jacobian matrices of polynomial maps
- Maximum weight spectrum codes
- Schur aggregation for linear systems and determinants
- Constrained multilinear detection and generalized graph motifs
- The \(k\)-distinct language: parameterized automata constructions
- On the Alon-Füredi bound
- Necessary field size and probability for MDP and complete MDP convolutional codes
- Degeneracy loci and polynomial equation solving
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.
- Fast exact algorithms using Hadamard product of polynomials
- scientific article; zbMATH DE number 7250150 (Why is no real title available?)
- Rigid realizations of graphs on small grids
- Local decoding and testing of polynomials over grids
- scientific article; zbMATH DE number 7378736 (Why is no real title available?)
- Verification protocols with sub-linear communication for polynomial matrix operations
- Change of order for regular chains in positive dimension
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- Dominator coloring and CD coloring in almost cluster graphs
- Estimating the norms of random circulant and Toeplitz matrices and their inverses
- Factoring sparse polynomials fast
- Randomized parallel algorithms
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- Lova: lattice-based folding scheme from unstructured lattices
- Nonclassical Berry-Esseen inequalities and accuracy of the bootstrap
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- The price of verifiability: lower bounds for verifiable random functions
- Much Ado about Zero
- The time-precision tradeoff problem on on-line probabilistic Turing machines
- Computational indistinguishability: A sample hierarchy
- A geometric index reduction method for implicit systems of differential algebraic equations
- Accelerated tower arithmetic
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
- Symbolic matrix factorization for differential-algebraic equations index reduction
- Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
- On groups with unbounded Cayley graphs
- Short Proofs for the Determinant Identities
- Reconstructing rational functions with \texttt{FireFly}
- Computing girth and cogirth in perturbed graphic matroids
- On Dinur’s proof of the PCP theorem
- Complexity results for triangular sets
- Characterizing arithmetic read-once formulae
- Selected topics on assignment problems
- The 1982 ACM Turing Award lecture. An overview of computational complexity
- Pattern matching with address errors: rearrangement distances
- A quantum-inspired mechanical method for proving of Ramsey's theorem by symbolic computation over the finite field GF(2)
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- Counting curves and their projections
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- Efficient Black-Box Identity Testing for Free Group Algebras
- An efficient solution for Cauchy-like systems of linear equations
- An efficient certificate-based signature scheme in the standard model
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
- The Elekes-Szabó theorem in four dimensions
- Bicorn: an optimistically efficient distributed randomness beacon
- A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
- On zeros of a polynomial in a finite grid
- Efficient parallel factorization and solution of structured and unstructured linear systems
- On approximation by \(^{\oplus}\)-OBDDs
- Fast dynamic transitive closure with lookahead
- A fast parallel algorithm for minimum-cost small integral flows
- Recent results on polynomial identity testing
- Fixed-parameter tractability of maximum colored path and beyond
- Parallel algorithms for matrix normal forms
- New progress in real and complex polynomial root-finding
- Enhancing the Extended Hensel Construction by Using Gröbner Bases
- Detecting and counting small pattern graphs
- Effective bounds on the dimensions of Jacobians covering abelian varieties
- Fast detection of degenerate predicates in free space construction
- Practical homomorphic message authenticators for arithmetic circuits
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- On division polynomial PIT and supersingularity
- Characterization of flip process rules with the same trajectories
- The inverse moment problem for convex polytopes
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Variants of the Erdős distinct sums problem and variance method
- A shuffle argument secure in the generic model
- Boolean ideals and their varieties
- Table based detection of degenerate predicates in free space construction
This page was built for publication: Fast Probabilistic Algorithms for Verification of Polynomial Identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3899517)
