Fetching the paper…
Reading the bibliography…
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas.
The use of linear graphs in Gauss elimination
S. Parter · 1961
Earlier work this paper cites.
Triangulated graphs and the elimination process
D. J. Rose · 1970
Earlier work this paper cites.
The Division Algorithm and the Hilbert Scheme
D. A. Bayer · 1982
Earlier work this paper cites.
On the desirability of acyclic database schemes
C. Beeri, R. Fagin, D. Maier, and M. Yannakakis · 1983
Earlier work this paper cites.
Complexity of finding embeddings in a k k -tree
S. Arnborg, D. G. Corneil, and A. Proskurowski · 1987
Earlier work this paper cites.
Local computations with probabilities on graphical structures and their application to expert systems
S. L. Lauritzen and D. J. Spiegelhalter · 1988
Earlier work this paper cites.
Schur products and matrix completions
V. I. Paulsen, S. C. Power, and R. R. Smith · 1989
Earlier work this paper cites.
Symbolic solution of polynomial equation systems with symmetry
K. Gatermann · 1990
Earlier work this paper cites.
On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
Y. N. Lakshman · 1990
Earlier work this paper cites.
Cohen-Macaulay graphs
R. Villarreal · 1990
Earlier work this paper cites.
An introduction to chordal graphs and clique trees
J. Blair and B. Peyton · 1993
Earlier work this paper cites.
Efficient incremental algorithms for the sparse resultant and the mixed volume
I. Z. Emiris and J. F. Canny · 1995
Earlier work this paper cites.
A polyhedral method for solving sparse polynomial systems
B. Huber and B. Sturmfels · 1995
Earlier work this paper cites.
Gröbner bases and convex polytopes
B. Sturmfels · 1996
Earlier work this paper cites.
Numerical solution of multivariate polynomial systems by homotopy continuation methods
T. Y. Li · 1997
Earlier work this paper cites.
Bucket elimination: A unifying framework for probabilistic inference
R. Dechter · 1998
Cited alongside, same era.
Constraint satisfaction, bounded treewidth, and finite-variable logics
V. Dalmau, P. G. Kolaitis, and M. Y. Vardi · 2002
Cited alongside, same era.
Polynomials of bounded treewidth
J. A. Makowsky and K. Meer · 2002
Cited alongside, same era.
Constraint processing
R. Dechter · 2003
Cited alongside, same era.
Gröbner basis structure of finite sets of points
S. Gao, V. M. Rodrigues, and J. Stroomer · 2003
Cited alongside, same era.
A column approximate minimum degree ordering algorithm
T. A. Davis, J. R. Gilbert, S. I. Larimore, and E. G. Ng · 2004
Cited alongside, same era.
Sparse SOS relaxations for minimizing functions that are summations of small polynomials
J. Nie and J. Demmel · 2008
Later among the works it cites.
PolyBoRi: A framework for Gröbner-basis computations with boolean polynomials
M. Brickenstein and A. Dreyer · 2009
Later among the works it cites.
Expressing combinatorial problems by systems of polynomial equations and Hilbert’s nullstellensatz
J. A. De Loera, J. Lee, S. Margulies, and S. Onn · 2009
Later among the works it cites.
Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
J. C. Faugère and S. Rahmany · 2009
Later among the works it cites.
Counting Zeros over Finite Fields Using Gröbner Bases
S. Gao · 2009
Later among the works it cites.
Binomial edge ideals and conditional independence statements
J. Herzog, T. Hibi, F. Hreinsdóttir, T. Kahle, and J. Rauh · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. C. Golumbic · 2004
Cited alongside, same era.
Elimination structures in scientific computing
A. Pothen and S. Toledo · 2004
Cited alongside, same era.
Small scale variants of the AES
C. Cid, S. Murphy, and M. Robshaw · 2005
Cited alongside, same era.
The Numerical solution of systems of polynomials arising in engineering and science
A. J. Sommese and C. W. Wampler · 2005
Cited alongside, same era.
New technique for solving sparse equation systems
H. Raddum and I. Semaev · 2006
Cited alongside, same era.
Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via SAT-solvers
G. V. Bard, N. T. Courtois, and C. Jefferson · 2007
Cited alongside, same era.
Later among the works it cites.
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity
J. C. Faugère, M. Safey El Din, and P. J. Spaenlehauer · 2011
Later among the works it cites.
Graph structure and monadic second-order logic: a language-theoretic approach
B. Courcelle and J. Engelfriet · 2012
Later among the works it cites.
Singular
W. Decker, G. M. Greuel, G. Pfister, and H. Schönemann · 2012
Later among the works it cites.
Polynomial systems solving by fast linear algebra
J. C. Faugère, P. Gaudry, L. Huot, and G. Renault · 2013
Later among the works it cites.
Sparse Gröbner bases: The unmixed case
J. C. Faugère, P. J. Spaenlehauer, and J. Svartz · 2014
Closest in time.
Sage Mathematics Software
W. A. Stein et al · 2014
Closest in time.
Chordal graphs and semidefinite optimization
L. Vandenberghe and M. S. Andersen · 2014
Closest in time.
Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases
J. A. De Loera, S. Margulies, M. Pernpeintner, E. Riedl, D. Rolnick, G. Spencer, D. Stasi, and J. Swenson · 2015
Closest in time.
Monomial algebras
R. Villarreal · 2015
Closest in time.