Pages that link to "Item:Q1296522"

The following pages link to Some complexity results for polynomial ideals (Q1296522):

Displaying 36 items.

• Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory (Q513343) (← links)
• Sparse effective membership problems via residue currents (Q634801) (← links)
• Binomial fibers and indispensable binomials (Q898283) (← links)
• Groebner basis methods for multichannel sampling with unknown offsets (Q952393) (← links)
• The ideal membership problem and polynomial identity testing (Q963063) (← links)
• Convex integer maximization via Graver bases (Q1017675) (← links)
• On the complexity of counting components of algebraic varieties (Q1030247) (← links)
• Computing dimension and independent sets for polynomial ideals (Q1116332) (← links)
• The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
• Verification complexity of linear prime ideals (Q1207526) (← links)
• On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
• Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
• On the robust hardness of Gröbner basis computation (Q1713027) (← links)
• Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
• Dehn functions of finitely presented metabelian groups (Q1983948) (← links)
• Subexponential-time computation of isolated primary components of a polynomial ideal (Q2027324) (← links)
• Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
• Finitely generated structures computable in polynomial time (Q2088618) (← links)
• Searching for applicable versions of computable structures (Q2117745) (← links)
• Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
• Polynomially computable structures with finitely many generators (Q2213937) (← links)
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
• Interpolation of ideals (Q2340468) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
• Deterministically Computing Reduction Numbers of Polynomial Ideals (Q2879324) (← links)
• (Q3710617) (← links)
• Membership problem, representation problem and the computation of the radical for one-dimensional ideals (Q3973339) (← links)
• (Q4015183) (← links)
• Complexity of Membership Problems of Different Types of Polynomial Ideals (Q4556588) (← links)
• (Q4963157) (← links)
• On polynomial ideals, their complexity, and applications (Q5055880) (← links)
• (Q5091175) (← links)
• Membership in polynomial ideals over Q is exponential space complete (Q5096173) (← links)
• (Q5371447) (← links)
• Macaulay-like marked bases (Q5739070) (← links)