Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Contextuality from missing and versioned data. | 0 | 0.34 | 2017 |
| Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits. | 1 | 0.36 | 2016 |
| Computing the Tutte Polynomial of Lattice Path Matroids Using Determinantal Circuits. | 2 | 0.42 | 2015 |
| Dimension Of Marginals Of Kronecker Product Models | 0 | 0.34 | 2015 |
| Discrete restricted Boltzmann machines. | 6 | 0.47 | 2015 |
| Tensor Network Contractions for #SAT. | 0 | 0.34 | 2014 |
| Relations among conditional probabilities | 0 | 0.34 | 2013 |
| Pfaffian Circuits | 0 | 0.34 | 2011 |
| Holographic algorithms without matchgates | 3 | 0.39 | 2009 |
| Convex Rank Tests and Semigraphoids | 6 | 1.17 | 2009 |
| Geometry of rank tests | 2 | 0.92 | 2006 |