Publications (47)
Computing the partition function of a polynomial on the Boolean cube
Alexander Barvinok
Partition functions for dense instances of combinatorial enumeration problems
Alexander Barvinok
Brunn-Minkowski Inequalities for Contingency Tables and Integer Flows
Alexander Barvinok
Enumerating contingency tables via random permanents
Alexander Barvinok
An approximation algorithm for counting contingency tables
Alexander Barvinok, Zur Luria, Alex Samorodnitsky +1
An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
Alexander Barvinok, J. A. Hartigan
Approximating a norm by a polynomial
Alexander Barvinok
Computing the Ehrhart quasi-polynomial of a rational simplex
Alexander Barvinok
Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes
Alexander Barvinok, John Hartigan
A simple polynomial time algorithm to approximate the permanent within a simply exponential factor
Alexander Barvinok
The distribution of values in the quadratic assignment problem
Alexander Barvinok, Tamon Stephen
Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes
Alexander Barvinok
On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
Alexander Barvinok
The Distance Approach to Approximate Combinatorial Counting
Alexander Barvinok, Alex Samorodnitsky
Approximating permanents and hafnians
Alexander Barvinok
Computing permanents of complex diagonally dominant matrices and tensors
Alexander Barvinok
Computing the partition function for graph homomorphisms
Alexander Barvinok, Pablo Soberón
The number of graphs and a random graph with a given degree sequence
Alexander Barvinok, J. A. Hartigan
Approximating orthogonal matrices by permutation matrices
Alexander Barvinok
Low rank approximations of symmetric polynomials and asymptotic counting of contingency tables
Alexander Barvinok
Random Weighting, Asymptotic Counting, and Inverse Isoperimetry
Alexander Barvinok, Alex Samorodnitsky
Matrices with prescribed row and column sums
Alexander Barvinok
Concentration of the mixed discriminant of well-conditioned matrices
Alexander Barvinok
Neighborliness of the symmetric moment curve
Alexander Barvinok, Seung Jin Lee, Isabella Novik
Computing the partition function for perfect matchings in a hypergraph
Alexander Barvinok, Alex Samorodnitsky
Convexity of the image of a quadratic map via the relative entropy distance
Alexander Barvinok
Thrifty approximations of convex bodies by polytopes
Alexander Barvinok
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Alexander Barvinok
A bound for the number of vertices of a polytope with applications
Alexander Barvinok
A centrally symmetric version of the cyclic polytope
Alexander Barvinok, Isabella Novik
Maximum entropy Edgeworth estimates of the number of integer points in polytopes
Alexander Barvinok, J. A. Hartigan
Computing the partition function for graph homomorphisms with multiplicities
Alexander Barvinok, Pablo Soberón
Convex Geometry of Orbits
Alexander Barvinok, Grigoriy Blekherman
Centrally symmetric polytopes with many faces
Alexander Barvinok, Seung Jin Lee, Isabella Novik
Counting magic squares in quasi-polynomial time
Alexander Barvinok, Alex Samorodnitsky, Alexander Yong
New Permanent Estimators via Non-Commutative Determinants
Alexander Barvinok
Computing the permanent of (some) complex matrices
Alexander Barvinok
Approximations of convex bodies by polytopes and by projections of spectrahedra
Alexander Barvinok
The Geometric Maximum Traveling Salesman Problem
Alexander Barvinok, Sandor P. Fekete, David S. Johnson +3
What does a random contingency table look like?
Alexander Barvinok
Estimating Maximum by Moments for Functions on Orbits
Alexander Barvinok
Approximating real-rooted and stable polynomials, with combinatorial applications
Alexander Barvinok
Short rational generating functions for lattice point problems
Alexander Barvinok, Kevin Woods
Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets
Alexander Barvinok, Seung Jin Lee, Isabella Novik
Searching for dense subsets in a graph via the partition function
Alexander Barvinok, Anthony Della Pella
Computing the partition function for cliques in a graph
Alexander Barvinok
The computational complexity of convex bodies
Alexander Barvinok, Ellen Veomett