activity
20072020
most citedExpressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz

15 citations · 40 across the 10 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.AC2013★ 1 cited

Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits

S. Margulies, J. Morton

A Pfaffian circuit is a tensor contraction network where the edges are labeled with changes of bases in such a way that a very specific set of combinatorial properties are satisfie…

math.CO2013

Weak Orientability of Matroids and Polynomial Equations

J. A. De Loera, J. Lee, S. Margulies +1

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally allu…