Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
From MaRDI portal
(Redirected from Publication:5889792)
Recommendations
- Discovering the roots: uniform closure results for algebraic classes under factoring
- Closure results for polynomial factorization
- Factors of low individual degree polynomials
- Factors of low individual degree polynomials
- Univariate polynomials, nearly optimal algorithms for factorization and rootfinding
Cites work
- A course in commutative algebra
- A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
- A modified Newton method for polynomials
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A probabilistic remark on algebraic program testing
- A unified method for multivariate polynomial factorizations
- Algebraic complexity classes
- Algebraic independence over positive characteristic: new criterion and applications to locally low algebraic rank circuits
- Algèbre
- Algorithm of polynomial complexity for factoring polynomials over local fields
- All Algebraic Functions Can Be Computed Fast
- Arithmetic circuits with locally low algebraic rank
- Arithmetic circuits: a survey of recent results and open questions
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Bootstrapping variables in algebraic circuits
- Boundaries of VP and VNP
- Bounded-degree factors of lacunary multivariate polynomials
- Closure results for polynomial factorization
- Completeness and reduction in algebraic complexity theory
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs
- Complexity of ring morphism problems
- Computing Algebraic Formulas Using a Constant Number of Registers
- Decoding of Reed Solomon codes beyond the error-correction bound
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Deterministic factorization of sparse polynomials with bounded individual degree
- Efficient algorithms for some special cases of the polynomial equivalence problem
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Equivalence of polynomial identity testing and polynomial factorization
- Evaluation of polynomials with super-preconditioning
- Expressing a fraction of two determinants as a determinant
- Factoring multivariate polynomials via partial differential equations
- Factoring Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials over local fields.
- Factoring polynomials with rational coefficients
- Factoring sparse multivariate polynomials
- Factorization of polynomials given by arithmetic branching programs
- Factors of low individual degree polynomials
- Fast Algorithms for Manipulating Formal Power Series
- Fast computation of the roots of polynomials over the ring of power series
- Fast Parallel Computation of Polynomials Using Few Processors
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Geometric complexity theory. V: Efficient algorithms for Noether normalization
- Gröbner bases and primary decomposition of polynomial ideals
- Hardness-randomness tradeoffs for bounded depth arithmetic circuits
- Hensel and Newton Methods in Valuation Rings
- scientific article; zbMATH DE number 1643926 (Why is no real title available?)
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 3856407 (Why is no real title available?)
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 15339 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3489250 (Why is no real title available?)
- scientific article; zbMATH DE number 3555467 (Why is no real title available?)
- scientific article; zbMATH DE number 1254268 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 1765103 (Why is no real title available?)
- scientific article; zbMATH DE number 1834636 (Why is no real title available?)
- scientific article; zbMATH DE number 928863 (Why is no real title available?)
- scientific article; zbMATH DE number 6789296 (Why is no real title available?)
- scientific article; zbMATH DE number 5049913 (Why is no real title available?)
- scientific article; zbMATH DE number 6472651 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- scientific article; zbMATH DE number 7711593 (Why is no real title available?)
- scientific article; zbMATH DE number 7711607 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Modern computer algebra
- Near-optimal bootstrapping of hitting sets for algebraic circuits
- Numerical Methods in Scientific Computing, Volume I
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On Algebraic Branching Programs of Small Width
- On Hensel factorization. I
- On the complexity of symmetric polynomials
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Proof complexity lower bounds from algebraic circuit complexity
- Quadratic Newton iteration for systems with multiplicity
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
- Sparse complex polynomials and polynomial reducibility
- Straight-line programs in geometric elimination theory
- The complexity of factors of multivariate polynomials
- The computational power of depth five arithmetic circuits
- Trading GRH for algebra: algorithms for factoring polynomials and related structures
- Unifying known lower bounds via geometric complexity theory
This page was built for publication: Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889792)
