A Kronecker algorithm for locally closed sets over a perfect field
From MaRDI portal
Cites work
- A concise proof of the Kronecker polynomial system solver from scratch
- A Gröbner free alternative for polynomial system solving
- A probabilistic remark on algebraic program testing
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- Algebraic geometry I: algebraic curves, algebraic manifolds and schemes. Transl. from the Russian by D. Coray and V. N. Shokurov
- Algebraic Geometry. I: Complex projective varieties.
- Bounds of traces in complete intersections and degrees in the Nullstellensatz
- Complexity of Bezout's Theorem I: Geometric Aspects
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Definability and fast quantifier elimination in algebraically closed fields
- Deformation techniques for efficient polynomial equation solving.
- Deformation techniques for sparse systems
- Deformation techniques to solve generalised Pham systems
- Erzeugungsgrad, VC-dimension and neural networks with rational activation function
- Fast computation of a rational point of a variety over a finite field
- Fast linear homotopy to find approximate zeros of polynomial systems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast separable factorization and applications
- Generic local structure of the morphisms in commutative algebra
- Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Festschrift zu Herrn Ernst Eduard Kummers fünfzigjährigem Doctor-Jubiläum, 10 September 1881)
- Heights of varieties in multiprojective spaces and arithmetic nullstellensätze
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 3859276 (Why is no real title available?)
- scientific article; zbMATH DE number 4165039 (Why is no real title available?)
- scientific article; zbMATH DE number 3897078 (Why is no real title available?)
- scientific article; zbMATH DE number 3973001 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1057737 (Why is no real title available?)
- scientific article; zbMATH DE number 1057749 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- Improved explicit estimates on the number of solutions of equations over a finite field
- Integer multiplication in time \(O(n\log n)\)
- Le rôle des structures de données dans les problèmes d'élimination
- Lectures on results on Bezout's theorem. Notes by D. P. Patil
- Lower bounds for diophantine approximations
- Modern computer algebra
- New bounds for matrix multiplication: from alpha to omega
- On computing the determinant in small parallel time using a small number of processors
- On the bit complexity of polynomial system solving
- On the complexity exponent of polynomial system solving
- On the complexity of the D5 principle
- On the computation of rational solutions of underdetermined systems over a finite field
- On the efficiency of effective Nullstellensätze
- On the time-space complexity of geometric elimination procedures
- Polynomial equation solving by lifting procedures for ramified fibers
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Solving polynomial systems equation by equation
- Solving zero-dimensional systems through the rational univariate representation
- Straight-line programs in geometric elimination theory
- The complexity of partial derivatives
- The distribution of defective multivariate polynomial systems over a finite field
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Théoremes de Bertini et applications
This page was built for publication: A Kronecker algorithm for locally closed sets over a perfect field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230640)
