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 (only showing first 100 items - show all)
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 ⋮ 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
This page was built for publication:
