• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

and S.Vempala, Integer Feasibility of Random Polytopes (0)

by K Chandrasekaran
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Random Structures and Algorithms

by Alan Frieze , 2004
"... We provide an introduction to the analysis of random combinatorial structures and some of the associated computational problems. ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We provide an introduction to the analysis of random combinatorial structures and some of the associated computational problems.
(Show Context)

Citation Context

...levich [57]; (vi) Smoothed Analysis of the Simplex Algorithm for Linear Programs, Spielman and Teng [108] or Vershynin [112]; (vii) Integer Feasibility of Random Polytopes, Chandrasekaran and Vempala =-=[30]-=-; (viii) Nash Equilibria in Random Matrix Games, Bárány, Vempala and Vetta [12]; (ix) Random Knapsack Problems, Lueker [92], Goldberg and Marchetti-Spaccemela [61], Beier and B. Vöcking [14]; (x) T...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University