SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
From MaRDI portal
Publication:3094333
DOI10.1142/S0218196711006364zbMath1228.13026OpenAlexW2083268538MaRDI QIDQ3094333
Publication date: 24 October 2011
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196711006364
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items (14)
Strong $\mu$-Bases for Rational Tensor Product Surfaces and Extraneous Factors Associated to Bad Base Points and Anomalies at Infinity ⋮ Gröbner bases and cocyclic Hadamard matrices ⋮ SOS Is Not Obviously Automatizable, Even Approximately ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ A computational approach to analyze the Hadamard quasigroup product ⋮ Mixed membership Gaussians ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ On the bit complexity of polynomial system solving ⋮ Computing characteristic classes of subschemes of smooth toric varieties ⋮ Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity ⋮ An algorithm for implicit interpolation ⋮ A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields ⋮ A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares ⋮ On the complexity of the \(F_5\) Gröbner basis algorithm
Cites Work
This page was built for publication: SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
