Alexander Barvinok

From MaRDI portal
Person:1360053

Available identifiers

zbMath Open barvinok.alexander-iDBLP77/6660WikidataQ20982614 ScholiaQ20982614MaRDI QIDQ1360053

List of research outcomes





PublicationDate of PublicationType
A quick estimate for the volume of a polyhedron2024-11-12Paper
Integrating products of quadratic forms2024-10-25Paper
Smoothed counting of 0–1 points in polyhedra2023-10-12Paper
Computing the theta function2022-08-10Paper
When a system of real quadratic equations has a solution2022-05-31Paper
A quick estimate for the volume of a polyhedron2021-12-12Paper
More on zeros and approximation of the Ising partition function2021-06-08Paper
A remark on approximating permanents of positive definite matrices2021-02-12Paper
Weighted counting of solutions to sparse systems of equations2020-04-06Paper
Approximating real-rooted and stable polynomials, with combinatorial applications2020-02-17Paper
Testing for Dense Subsets in a Graph via the Partition Function2020-01-31Paper
Stability and complexity of mixed discriminants2019-12-27Paper
Computing permanents of complex diagonally dominant matrices and tensors2019-08-12Paper
The tensorization trick in convex geometry2019-06-12Paper
Approximating permanents and hafnians2019-01-09Paper
Computing the Partition Function of a Polynomial on the Boolean Cube2018-02-26Paper
Computing the partition function for graph homomorphisms2018-02-12Paper
Computing permanents of complex diagonally dominant matrices and tensors2018-01-12Paper
Counting integer points in higher-dimensional polytopes2017-09-27Paper
Combinatorics and complexity of partition functions2017-02-14Paper
Some algorithmic applications of partition functions in combinatorics2017-01-25Paper
Computing the permanent of (some) complex matrices2016-05-19Paper
Computing the partition function for cliques in a graph2016-02-02Paper
Concentration of the mixed discriminant of well-conditioned matrices2016-01-28Paper
The geometric maximum traveling salesman problem2015-11-12Paper
Computing the partition function for graph homomorphisms with multiplicities2015-11-06Paper
On testing Hamiltonicity of graphs2014-11-07Paper
Convexity of the image of a quadratic map via the relative entropy distance2014-10-30Paper
Thrifty Approximations of Convex Bodies by Polytopes2014-09-25Paper
A bound for the number of vertices of a polytope with applications2014-07-21Paper
Centrally symmetric polytopes with many faces2013-11-01Paper
An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums2013-07-25Paper
Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets2013-06-07Paper
The number of graphs and a random graph with a given degree sequence2013-05-28Paper
Partition functions for dense instances of combinatorial enumeration problems2013-05-11Paper
NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE2013-03-13Paper
Approximations of convex bodies by polytopes and by projections of spectrahedra2012-04-02Paper
Matrices with prescribed row and column sums2012-03-08Paper
Computing the Partition Function for Perfect Matchings in a Hypergraph2011-12-08Paper
An approximation algorithm for counting contingency tables2010-11-24Paper
What Does a Random Contingency Table Look Like?2010-10-14Paper
Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes2010-07-13Paper
On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries2010-04-06Paper
https://portal.mardi4nfdi.de/entity/Q36199342009-04-14Paper
Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes2009-03-16Paper
Integer points in polyhedra2008-09-08Paper
https://portal.mardi4nfdi.de/entity/Q35145202008-07-21Paper
A centrally symmetric version of the cyclic polytope2008-04-16Paper
Enumerating Contingency Tables via Random Permanents2008-03-10Paper
https://portal.mardi4nfdi.de/entity/Q54320432008-01-02Paper
Integration and optimization of multivariate polynomials by restriction onto a random subspace2007-12-03Paper
Random weighting, asymptotic counting, and inverse isoperimetry2007-09-03Paper
Brunn--Minkowski inequalities for contingency tables and integer flows2007-04-18Paper
Counting magic squares in quasi-polynomial time2007-03-08Paper
Approximating orthogonal matrices by permutation matrices2007-02-20Paper
https://portal.mardi4nfdi.de/entity/Q54910122006-09-26Paper
Computing the Ehrhart quasi-polynomial of a rational simplex2006-05-29Paper
https://portal.mardi4nfdi.de/entity/Q52902512006-04-28Paper
The Distribution of Values in the Quadratic Assignment Problem2005-11-11Paper
Low rank approximations of symmetric polynomials and asymptotic counting of contingency tables2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q47375392004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44619142004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44291622003-09-24Paper
Short rational generating functions for lattice point problems2003-08-13Paper
https://portal.mardi4nfdi.de/entity/Q47901102003-01-28Paper
https://portal.mardi4nfdi.de/entity/Q44244372003-01-01Paper
The distance approach to approximate combinatorial counting2002-02-28Paper
Estimating Maximum by Moments for Functions on Orbits2002-01-03Paper
Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.2002-01-01Paper
A remark on the rank of positive semidefinite matrices subject to affine constraints2001-10-04Paper
New Permanent Estimators via Non-Commutative Determinants2000-07-25Paper
https://portal.mardi4nfdi.de/entity/Q49384702000-07-19Paper
https://portal.mardi4nfdi.de/entity/Q42527122000-04-26Paper
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor1999-12-19Paper
https://portal.mardi4nfdi.de/entity/Q44009971999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q38403591999-04-19Paper
https://portal.mardi4nfdi.de/entity/Q43584351998-10-01Paper
On the Betti numbers of semialgebraic sets defined by few quadratic inequalities1997-08-28Paper
Measure concentration in optimization1997-08-28Paper
Computing mixed discriminants, mixed volumes, and permanents1997-08-24Paper
Sparse interpolation of symmetric polynomials1997-07-06Paper
Two Algorithmic Results for the Traveling Salesman Problem1996-10-03Paper
New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems1996-09-02Paper
Problems of distance geometry and convex properties of quadratic maps1996-01-10Paper
Feasibility testing for systems of real quadratic equations1995-05-15Paper
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed1995-05-14Paper
Computing the Ehrhart polynomial of a convex lattice polytope1994-08-10Paper
https://portal.mardi4nfdi.de/entity/Q42935721994-07-18Paper
Exponential sums and integrals over convex polytopes1994-04-12Paper
Computing the volume, counting integral points, and exponential sums1993-09-30Paper
https://portal.mardi4nfdi.de/entity/Q40264911993-02-21Paper
On equivariant generalization of Dehn-Sommerville equations1993-02-03Paper
https://portal.mardi4nfdi.de/entity/Q40214071993-01-16Paper
Computation of exponential integrals1992-09-27Paper
Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity1992-09-26Paper
The Newton sums method in combinatorial optimization1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47121531992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47107101992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33621741991-01-01Paper
Problems of combinatorial optimization, statistical sums, and representations of the full linear group1991-01-01Paper
Computational complexity of immanents and representations of the full linear group1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34863701989-01-01Paper
Convex hulls of orbits of representations of finite groups and combinatorial optimization1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37948251988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57539561987-01-01Paper
Homological type of spaces of configurations of structurally stable type in \({\mathbb{C}}^ 2\)1986-01-01Paper
A simple polynomial time algorithm to approximate the permanent within a simply exponential factorN/APaper

Research outcomes over time

This page was built for person: Alexander Barvinok