Barvinok

Results: 35



#Item
11COMPUTING THE PERMANENT OF (SOME) COMPLEX MATRICES Alexander Barvinok June 2014 Abstract. We present a deterministic algorithm, which, for any given 0 <  < 1

COMPUTING THE PERMANENT OF (SOME) COMPLEX MATRICES Alexander Barvinok June 2014 Abstract. We present a deterministic algorithm, which, for any given 0 <  < 1

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English
12CONVEXITY OF THE IMAGE OF A QUADRATIC MAP VIA THE RELATIVE ENTROPY DISTANCE Alexander Barvinok May 2013 Abstract. Let ψ : Rn −→ Rk be a map defined by k positive definite quadratic

CONVEXITY OF THE IMAGE OF A QUADRATIC MAP VIA THE RELATIVE ENTROPY DISTANCE Alexander Barvinok May 2013 Abstract. Let ψ : Rn −→ Rk be a map defined by k positive definite quadratic

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2013-05-01 15:02:46
13ASYMPTOTIC ESTIMATES FOR THE NUMBER OF CONTINGENCY TABLES, INTEGER FLOWS, AND VOLUMES OF TRANSPORTATION POLYTOPES Alexander Barvinok August 2008

ASYMPTOTIC ESTIMATES FOR THE NUMBER OF CONTINGENCY TABLES, INTEGER FLOWS, AND VOLUMES OF TRANSPORTATION POLYTOPES Alexander Barvinok August 2008

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2008-08-21 18:20:03
14APPROXIMATIONS OF CONVEX BODIES BY POLYTOPES AND BY PROJECTIONS OF SPECTRAHEDRA Alexander Barvinok April 2012 Abstract. We prove that for any compact set B ⊂ Rd and for any ǫ > 0 there is a

APPROXIMATIONS OF CONVEX BODIES BY POLYTOPES AND BY PROJECTIONS OF SPECTRAHEDRA Alexander Barvinok April 2012 Abstract. We prove that for any compact set B ⊂ Rd and for any ǫ > 0 there is a

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2012-04-12 09:41:32
15THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2011-11-22 11:29:45
16MATRICES WITH PRESCRIBED ROW AND COLUMN SUMS Alexander Barvinok October 2010 Abstract. This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices wit

MATRICES WITH PRESCRIBED ROW AND COLUMN SUMS Alexander Barvinok October 2010 Abstract. This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices wit

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2010-10-27 10:36:40
17Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets Alexander Barvinok ∗

Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets Alexander Barvinok ∗

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2012-04-19 13:31:46
18ENUMERATING CONTINGENCY TABLES VIA RANDOM PERMANENTS Alexander Barvinok March 2006 Abstract. Given m positive integers R = (ri ), n positive integers C = (cj ) such

ENUMERATING CONTINGENCY TABLES VIA RANDOM PERMANENTS Alexander Barvinok March 2006 Abstract. Given m positive integers R = (ri ), n positive integers C = (cj ) such

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2006-03-07 12:57:11
19ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2014-08-27 10:06:40
20WHAT DOES A RANDOM CONTINGENCY TABLE LOOK LIKE? Alexander Barvinok November 2009 Abstract. Let R = (r1 , . . . , rm ) and C = (c1 , . . . , cn ) be positive integer vectors

WHAT DOES A RANDOM CONTINGENCY TABLE LOOK LIKE? Alexander Barvinok November 2009 Abstract. Let R = (r1 , . . . , rm ) and C = (c1 , . . . , cn ) be positive integer vectors

Add to Reading List

Source URL: www.math.lsa.umich.edu

Language: English - Date: 2009-11-25 09:10:05