Pages that link to "Item:Q3094333"

The following pages link to SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING (Q3094333):

Displaying 22 items.

• Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\) (Q432760) (← links)
• Computing characteristic classes of subschemes of smooth toric varieties (Q511874) (← links)
• An algorithm for implicit interpolation (Q744017) (← links)
• Gröbner bases and cocyclic Hadamard matrices (Q1635271) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
• Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
• A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares (Q2326748) (← links)
• On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
• Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity (Q2516428) (← links)
• Mixed membership Gaussians (Q2692919) (← links)
• A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields (Q2831035) (← links)
• On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822) (← links)
• (Q3360999) (← links)
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)
• SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
• Strong $\mu$-Bases for Rational Tensor Product Surfaces and Extraneous Factors Associated to Bad Base Points and Anomalies at Infinity (Q5283251) (← links)
• Improving bounds on elliptic curve hidden number problem for ECDH key exchange (Q6135458) (← links)
• A computational approach to analyze the Hadamard quasigroup product (Q6153084) (← links)
• Square-free pure triangular decomposition of zero-dimensional polynomial systems (Q6594999) (← links)
• A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium (Q6597203) (← links)
• A single exponential time algorithm for homogeneous regular sequence tests (Q6601873) (← links)