Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring

Cites Work

Title not available (Why is that?)
Numerical Methods in Scientific Computing, Volume I
COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
Title not available (Why is that?)
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Title not available (Why is that?)
Factoring polynomials with rational coefficients
A probabilistic remark on algebraic program testing
Title not available (Why is that?)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Computing Algebraic Formulas Using a Constant Number of Registers
Title not available (Why is that?)
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
A modified Newton method for polynomials
Straight-line programs in geometric elimination theory
Quadratic Newton iteration for systems with multiplicity
Title not available (Why is that?)
Fast Algorithms for Manipulating Formal Power Series
Gröbner bases and primary decomposition of polynomial ideals
Title not available (Why is that?)
Factoring Polynomials Over Large Finite Fields
Completeness and reduction in algebraic complexity theory
Fast Parallel Computation of Polynomials Using Few Processors
Modern computer algebra
Improved decoding of Reed-Solomon and algebraic-geometry codes
Title not available (Why is that?)
Factoring sparse multivariate polynomials
Decoding of Reed Solomon codes beyond the error-correction bound
Equivalence of polynomial identity testing and polynomial factorization
Factors of low individual degree polynomials
Arithmetic circuits: a survey of recent results and open questions
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
A New Algorithm for Factoring Polynomials Over Finite Fields
Derandomizing polynomial identity tests means proving circuit lower bounds
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Factoring multivariate polynomials via partial differential equations
All Algebraic Functions Can Be Computed Fast
Factoring Polynomials over Algebraic Number Fields
Title not available (Why is that?)
Expressing a fraction of two determinants as a determinant
A course in commutative algebra
Title not available (Why is that?)
Title not available (Why is that?)
Factoring polynomials over local fields.
Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
Title not available (Why is that?)
On Hensel factorization. I
Title not available (Why is that?)
Title not available (Why is that?)
The complexity of factors of multivariate polynomials
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Hensel and Newton Methods in Valuation Rings
Complexity of ring morphism problems
A unified method for multivariate polynomial factorizations
Title not available (Why is that?)
Title not available (Why is that?)
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
Bounded-degree factors of lacunary multivariate polynomials
Sparse complex polynomials and polynomial reducibility
Fast Computation of the Roots of Polynomials Over the Ring of Power Series
Algebraic complexity classes
Title not available (Why is that?)
Title not available (Why is that?)
Evaluation of polynomials with super-preconditioning
Algorithm of polynomial complexity for factoring polynomials over local fields
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
Title not available (Why is that?)
Unifying known lower bounds via geometric complexity theory
Algèbre
Bootstrapping variables in algebraic circuits
Proof Complexity Lower Bounds from Algebraic Circuit Complexity
On Algebraic Branching Programs of Small Width
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
Geometric complexity theory. V: Efficient algorithms for Noether normalization
Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
Boundaries of VP and VNP
Title not available (Why is that?)
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree
The Computational Power of Depth Five Arithmetic Circuits
Title not available (Why is that?)
Title not available (Why is that?)
Factorization of polynomials given by arithmetic branching programs
Title not available (Why is that?)

Uses Software

Mulprec

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)