scientific article; zbMATH DE number 3651744

Cited in

(only showing first 100 items - show all)

Multipartite secret sharing by bivariate interpolation
Interpolation of polynomials given by straight-line programs
A parameterized view on matroid optimization problems
Maximum weight bipartite matching in matrix multiplication time
Approximate string matching with address bit errors
Randomized algorithms in combinatorial optimization: A survey
Factoring sparse multivariate polynomials
Computer algebra: Past and future
GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
Three new algorithms for multivariate polynomial GCD
A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method
Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
Finding the radical of matrix algebras using Fitting decompositions
The complexity of sparse polynomial interpolation over finite fields
Efficient matrix preconditioners for black box linear algebra
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Straight-line programs in geometric elimination theory
On testing for zero polynomials by a set of points with bounded precision.
Efficient decomposition of separable algebras.
Polynomial-exponential decomposition from moments
An improved early termination sparse interpolation algorithm for multivariate polynomials
Computing sparse GCD of multivariate polynomials via polynomial interpolation
On division polynomial PIT and supersingularity
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
Exploring crypto dark matter: new simple PRF candidates and their applications
Multivariate exponential analysis from the minimal number of samples
Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
Resultant elimination via implicit equation interpolation
Joint equidistribution of CM points
Practical homomorphic message authenticators for arithmetic circuits
A new algorithm for computing the extended Hensel construction of multivariate polynomials
An efficient solution for Cauchy-like systems of linear equations
A probabilistic algorithm for verifying polynomial middle product in linear time
A new approach to fast polynomial interpolation and multipoint evaluation
Randomised algorithms
Functional programming concepts and straight-line programs in computer algebra
On the complexity of pattern matching for highly compressed two-dimensional texts.
Early termination in sparse interpolation algorithms
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Fast computation of discrete invariants associated to a differential rational mapping
Complexity results for triangular sets
Weighted Reed-Muller codes revisited
Randomized preprocessing versus pivoting
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
A case of depth-3 identity testing, sparse factorization and duality
New techniques for the computation of linear recurrence coefficients
Superfast algorithms for Cauchy-like matrix computations and extensions
A fast parallel sparse polynomial GCD algorithm
Verification protocols with sub-linear communication for polynomial matrix operations
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
Sparse affine-invariant linear codes are locally testable
On measures of space over real and complex numbers
Linear matroid intersection is in quasi-NC
New bounds and an efficient algorithm for sparse difference resultants
Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
Obfuscating circuits via composite-order graded encoding
On subversion-resistant SNARKs
Blackbox identity testing for sum of special ROABPs and its border class
Many-visits TSP revisited
A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
Univariate ideal membership parameterized by rank, degree, and number of generators
Simple multi-party set reconciliation
Improved hitting set for orbit of ROABPs
Parameterized complexity of list coloring and max coloring
Polynomial modular product verification and its implications
Non-malleability against polynomial tampering
An interpolation algorithm for computing Dixon resultants
Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Sparse polynomial interpolation based on diversification
Integration-by-parts reductions of Feynman integrals using singular and GPI-space
Tropical combinatorial Nullstellensatz and sparse polynomials
Algorithms for computing greatest common divisors of parametric multivariate polynomials
On groups with unbounded Cayley graphs
Strong security of linear ramp secret sharing schemes with general access structures
Revisiting the parameterized complexity of maximum-duo preservation string mapping
Nonclassical Berry-Esseen inequalities and accuracy of the bootstrap
Normal projection: deterministic and probabilistic algorithms
A note on parameterized polynomial identity testing using hitting set generators
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
Elimination-based certificates for triangular equivalence and rank profiles
The complexity of sparse Hensel lifting and sparse polynomial factorization
Partition-balanced families of codes and asymptotic enumeration in coding theory
Improved distance queries and cycle counting by Frobenius normal form
Accelerated tower arithmetic
Degeneracy loci and polynomial equation solving
Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
Relating \(p\)-adic eigenvalues and the local Smith normal form
Equivalence of polynomial identity testing and polynomial factorization
Monomials in arithmetic circuits: complete problems in the counting hierarchy
Generalized Wong sequences and their applications to Edmonds' problems
A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
Maximum matchings in planar graphs via Gaussian elimination
Lifting and recombination techniques for absolute factorization
On the analysis of cryptographic assumptions in the generic ring model
A new algorithm for sparse interpolation of multivariate polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3851616)