The following pages link to Alexander I. Barvinok (Q1360053):
Displaying 29 items.
- Computing the permanent of (some) complex matrices (Q285430) (← links)
- (Q375861) (redirect page) (← links)
- Centrally symmetric polytopes with many faces (Q375863) (← links)
- Convexity of the image of a quadratic map via the relative entropy distance (Q464812) (← links)
- On testing Hamiltonicity of graphs (Q468434) (← links)
- Combinatorics and complexity of partition functions (Q511202) (← links)
- Sparse interpolation of symmetric polynomials (Q678607) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- Computing the volume, counting integral points, and exponential sums (Q685177) (← links)
- Matrices with prescribed row and column sums (Q763065) (← links)
- (Q806675) (redirect page) (← links)
- Problems of combinatorial optimization, statistical sums, and representations of the full linear group (Q806676) (← links)
- Approximating orthogonal matrices by permutation matrices (Q866456) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
- Concentration of the mixed discriminant of well-conditioned matrices (Q905709) (← links)
- Computational complexity of immanents and representations of the full linear group (Q919059) (← links)
- Integer points in polyhedra (Q942862) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed (Q4698099) (← links)
- The Newton sums method in combinatorial optimization (Q4712351) (← links)
- Two Algorithmic Results for the Traveling Salesman Problem (Q4880877) (← links)
- The number of graphs and a random graph with a given degree sequence (Q4921886) (← links)
- More on zeros and approximation of the Ising partition function (Q4992410) (← links)
- Stability and complexity of mixed discriminants (Q5207439) (← links)
- The Distribution of Values in the Quadratic Assignment Problem (Q5704114) (← links)
- Smoothed counting of 0–1 points in polyhedra (Q6051058) (← links)
