Computing Toric Ideals (original) (raw)

On the Complexity of Toric Ideals

Shmuel Onn

ArXiv, 2019

View PDFchevron_right

Toric ideals generated by quadratic binomials

lejla lekic

Journal of Algebra, 1999

View PDFchevron_right

An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection

Isabel Bermejo

Journal of Symbolic Computation, 2007

View PDFchevron_right

Checking if the toric ideal of an ane monomial curve is a complete intersection

Isabel Bermejo

2000

View PDFchevron_right

Short rational functions for toric algebra and applications

Ruriko Yoshida

Journal of Symbolic Computation, 2004

View PDFchevron_right

Some Complexity Results for Polynomial Ideals

Ernst W Mayr

Journal of Complexity, 1997

View PDFchevron_right

Indispensable monomials of toric ideals and Markov bases

Ruriko Yoshida

View PDFchevron_right

Computing real powers of monomial ideals

Dylan Ruff

arXiv (Cornell University), 2021

View PDFchevron_right

Graphs and complete intersection toric ideals

Isabel Bermejo

Journal of Algebra and Its Applications, 2015

View PDFchevron_right

Computing Ideals of Points

A. Bigatti, Martin Kreuzer

Journal of Symbolic Computation, 2000

View PDFchevron_right

The membership problem for unmixed polynomial ideals is solvable in single exponential time

J. Heintz

1991

View PDFchevron_right

Computing generating sets of lattice ideals

Raymond Hemmecke

View PDFchevron_right

A parallel Buchberger algorithm for multigraded ideals

Jason Dusek

Computing Research Repository, 2011

View PDFchevron_right

Efficient generation of ideals in polynomial rings

farah waheeda

Journal of Algebra, 1983

View PDFchevron_right

Ideals, Varieties, and Algorithms. An introduction to Computational Algebraic Geometry and Commutative Algebra. Third Edition (2007). Springer

Gerard Forever

Solved problems, 2021

View PDFchevron_right

Computing with toric varieties

David Joyner

Journal of Symbolic Computation, 2007

View PDFchevron_right

Toric ideals which are determinantal

Rashid Zaare Nahandi

2021

View PDFchevron_right

Degree Bounds and Complexity of Gröbner Bases of Important Classes of Polynomial Ideals

Stephan Ritscher

2012

View PDFchevron_right

Decision Complexity of Generic Complete Intersections Efficient Parallel Algorithms for Computational Problems in the Theory of Algebraic Curves Open Problem Session Speakers: Joachim von zur Gathen E-Mail Addresses

Luis M Pardo

View PDFchevron_right

Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals

Ramon Piedra Sanchez

Journal of Symbolic Computation, 2000

View PDFchevron_right

Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach

DIEGO ALEJANDRO VALENCIA CIFUENTES

SIAM Journal on Discrete Mathematics, 2016

View PDFchevron_right

Real powers of monomial ideals

Josiah Lim

2021

View PDFchevron_right

Dimensional Analysis Using Toric Ideals: Primitive Invariants

Henry Wynn

PLoS ONE, 2014

View PDFchevron_right

Chordal Networks of Polynomial Ideals

Diego Cifuentes

SIAM Journal on Applied Algebra and Geometry

View PDFchevron_right

Ring graphs and complete intersection toric ideals

Enrique Reyes

Discrete Mathematics, 2010

View PDFchevron_right

Computational methods for t-spread monomial ideals

Luca Amata

2021

View PDFchevron_right

Parametric Decomposition of Monomial Ideals, II

William Heinzer

Journal of Algebra, 1997

View PDFchevron_right

An Algorithm for the Quillen–Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals

Karen Schlauch

Journal of Symbolic Computation, 2000

View PDFchevron_right

Quite Inefficient Algorithms for Solving Systems of Polynomial Equations Without Gröbner Bases! Resultants, Primary Decomposition and Galois Groups

Lars Wallenborn

2016

View PDFchevron_right