scientific article
From MaRDI portal
Publication:3851616
zbMath0418.68040MaRDI QIDQ3851616
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Special polynomials in general fields (12E10) Algorithms in computer science (68W99)
Related Items
Spotting Trees with Few Leaves, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Proof of the Kakeya set conjecture over rings of integers modulo square-free N, Generic complexity of the membership problem for semigroups of integer matrices, The đ-adic Kakeya conjecture, A New Black Box Factorization Algorithm - the Non-monic Case, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Connections between graphs and matrix spaces, SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Practical sublinear proofs for R1CS from lattices, On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r)\)], Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric, MyOPE: malicious security for oblivious polynomial evaluation, Dominator coloring and CD coloring in almost cluster graphs, On time-lock cryptographic assumptions in abelian hidden-order groups, Beyond Uber: instantiating generic groups via PGGs, Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond, Unnamed Item, Balancing act: multivariate rational reconstruction for IBP, Hardness of graph-structured algebraic and symbolic problems, Bounds on the higher degree ErdĆs-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\), Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof, Diverse collections in matroids and graphs, Computing isomorphisms between lattices, Unnamed Item, Unnamed Item, Unnamed Item, The Monomial Ideal Membership Problem and Polynomial Identity Testing, Many Visits TSP Revisited, Efficient Black-Box Identity Testing for Free Group Algebras, On multivariate polynomials with many roots over a finite grid, Improved Explicit Hitting-Sets for ROABPs, Symbolic-numeric sparse interpolation of multivariate polynomials, Depth-4 Identity Testing and Noetherâs Normalization Lemma, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, Fast differential eleminination in C: The CDiffElim environment, Unnamed Item, Unnamed Item, Randomized interpolation and approximation of sparse polynomials stPreliminary version, The \(k\)-distinct language: parameterized automata constructions, Effective bounds on the dimensions of Jacobians covering abelian varieties, Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives, Short Proofs for the Determinant Identities, Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits, Parameterized Pre-Coloring Extension and List Coloring Problems, Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, Probabilistic Saturations and Altâs Problem, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Factoring multivariate polynomials via partial differential equations, Maximum matchings in planar graphs via Gaussian elimination, Lifting and recombination techniques for absolute factorization, Spotting Trees with Few Leaves, On the analysis of cryptographic assumptions in the generic ring model, A new algorithm for sparse interpolation of multivariate polynomials, Schur aggregation for linear systems and determinants, Sparse polynomial interpolation based on diversification, Exact learning from an honest teacher that answers membership queries, Parametric nonlinear discrete optimization over well-described sets and matroid intersections, Computing generators of the ideal of a smooth affine algebraic variety, Prony's method in several variables: symbolic solutions by universal interpolation, On the complexity exponent of polynomial system solving, Simultaneous robust subspace recovery and semi-stability of quiver representations, Characterizing Propositional Proofs as Noncommutative Formulas, Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces, Improved Parameterized Algorithms for Network Query Problems, Improved parameterized algorithms for network query problems, On the complexity landscape of connected \(f\)-factor problems, An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form, Irreducibility of random polynomials of bounded degree, Integration-by-parts reductions of Feynman integrals using singular and GPI-space, Unnamed Item, Unnamed Item, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Additive Preconditioning for Matrix Computations, On sets of linear forms of maximal complexity, Automated analysis of cryptographic assumptions in generic group models, Approximate String Matching with Address Bit Errors, Tropical combinatorial Nullstellensatz and sparse polynomials, Unnamed Item, 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, Unnamed Item, On additive-nilpotency of Jacobian matrices of polynomial maps, Weak identifiability for differential algebraic systems, Revisiting the parameterized complexity of maximum-duo preservation string mapping, Nonclassical Berry-Esseen inequalities and accuracy of the bootstrap, Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size, Barriers for Rank Methods in Arithmetic Complexity, Improved dense multivariate polynomial factorization algorithms, Witnessing matrix identities and proof complexity, On Zeros of a Polynomial in a Finite Grid, Recent Results on Polynomial Identity Testing, Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth, Algebraic Independence and Blackbox Identity Testing, Processor efficient parallel matching, Change of order for regular chains in positive dimension, Regularization and Matrix Computation in Numerical Polynomial Algebra, Normal projection: deterministic and probabilistic algorithms, Efficient parallel factorization and solution of structured and unstructured linear systems, On the complexity of the resolvent representation of some prime differential ideals, A note on parameterized polynomial identity testing using hitting set generators, Generalized commutators and a problem related to the AmitsurâLevitzki theorem, On the size of Kakeya sets in finite fields, New bounds and an efficient algorithm for sparse difference resultants, Average-case linear matrix factorization and reconstruction of low width algebraic branching programs, Unnamed Item, Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables, Elimination-based certificates for triangular equivalence and rank profiles, The complexity of sparse Hensel lifting and sparse polynomial factorization, Estimating the norms of random circulant and Toeplitz matrices and their inverses, Obfuscating circuits via composite-order graded encoding, On subversion-resistant SNARKs, Blackbox identity testing for sum of special ROABPs and its border class, An improved EZ-GCD algorithm for multivariate polynomials, Partition-balanced families of codes and asymptotic enumeration in coding theory, Many-visits TSP revisited, A promenade through correct test sequences. I: Degree of constructible sets, BĂ©zout's inequality and density, Three-Player Entangled XOR Games are NP-Hard to Approximate, Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits, Using Sparse Interpolation in Hensel Lifting, Enhancing the Extended Hensel Construction by Using Gröbner Bases, Unnamed Item, Improved distance queries and cycle counting by Frobenius normal form, Univariate ideal membership parameterized by rank, degree, and number of generators, Simple multi-party set reconciliation, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, Bipartite Perfect Matching is in Quasi-NC, Fast computation of a rational point of a variety over a finite field, Improved hitting set for orbit of ROABPs, Accelerated tower arithmetic, Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture, On Dinurâs proof of the PCP theorem, Parameterized complexity of list coloring and max coloring, Degeneracy loci and polynomial equation solving, Polynomial modular product verification and its implications, Non-malleability against polynomial tampering, Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case, An interpolation algorithm for computing Dixon resultants, 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, 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, A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties, On the complexity of pattern matching for highly compressed two-dimensional texts., Randomized algorithms in combinatorial optimization: A survey, Factoring sparse multivariate polynomials, 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, More efficient shuffle argument from unique factorization, 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, Zero testing of algebraic functions, Computational schemes for subresultant chains, Fast exact algorithms using Hadamard product of polynomials, 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, Subexponential size hitting sets for bounded depth multilinear formulas, Efficient matrix preconditioners for black box linear algebra, On approximation by \(^{\oplus}\)-OBDDs, Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach, Additive preconditioning for matrix computations, Rural postman parameterized by the number of components of required edges, Computer algebra: Past and future, Parameterized algorithms for the module motif problem, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Multivariate exponential analysis from the minimal number of samples, Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions, Straight-line programs in geometric elimination theory, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, On enumerating monomials and other combinatorial structures by polynomial interpolation, Deterministic identity testing for sum of read-once oblivious arithmetic branching programs, Sparse multivariate polynomial interpolation on the basis of Schubert polynomials, Weighted Reed-Muller codes revisited, Resultant elimination via implicit equation interpolation, Matrix computations and polynomial root-finding with preprocessing, On testing for zero polynomials by a set of points with bounded precision., Randomized preprocessing versus pivoting, Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing, Sparse interpolation of multivariate rational functions, A case of depth-3 identity testing, sparse factorization and duality, Interpolating polynomials from their values, Joint equidistribution of CM points, The generalized ErdĆs-Falconer distance problems in vector spaces over finite fields, An explicit separation of relativised random polynomial time and relativised deterministic polynomial time, Solving linear systems of equations with randomization, augmentation and aggregation, Detecting lacunary perfect powers and computing their roots, Pattern matching with address errors: rearrangement distances, Macsyma: A personal history, Efficient decomposition of separable algebras., New techniques for the computation of linear recurrence coefficients, Sparse bivariate polynomial factorization, On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields, Parameterized algorithms for list \(K\)-cycle, Common composites of triangular polynomial systems and hash functions, Superfast algorithms for Cauchy-like matrix computations and extensions, Read-once polynomial identity testing, \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials, Degeneration of structured integer matrices modulo an integer, Odd properly colored cycles in edge-colored graphs, On the Alon-FĂŒredi bound, Practical homomorphic message authenticators for arithmetic circuits, Three new algorithms for multivariate polynomial GCD, Solving structured linear systems with large displacement rank, A fast parallel sparse polynomial GCD algorithm, Verification protocols with sub-linear communication for polynomial matrix operations, 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, Categories generated by a trivalent vertex, Additive preconditioning, eigenspaces, and the inverse iteration, A new algorithm for computing the extended Hensel construction of multivariate polynomials, Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?, Randomized preprocessing of homogeneous linear systems of equations, An efficient solution for Cauchy-like systems of linear equations, Sparse affine-invariant linear codes are locally testable, New progress in real and complex polynomial root-finding, Deterministically testing sparse polynomial identities of unbounded degree, A parametric representation of totally mixed Nash equilibria, On measures of space over real and complex numbers, The inverse moment problem for convex polytopes, Probabilistic algorithms for computing resolvent representations of regular differential ideals, A geometric index reduction method for implicit systems of differential algebraic equations, Linear matroid intersection is in quasi-NC, Building above read-once polynomials: identity testing and hardness of representation, A probabilistic algorithm for verifying polynomial middle product in linear time, A new approach to fast polynomial interpolation and multipoint evaluation, An algorithm for implicit interpolation, 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, Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones, Approximate string matching with address bit errors, Randomised algorithms, Finding the radical of matrix algebras using Fitting decompositions, Functional programming concepts and straight-line programs in computer algebra, The complexity of sparse polynomial interpolation over finite fields, Constrained multilinear detection and generalized graph motifs
