BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
complex (4)
path (2)
extens (2)
match (2)
relax (2)

Stem polytop$ (all stems)

18 papers:

CAVCAV-2015-GleissenthallKR #verification
Symbolic Polytopes for Quantitative Interpolation and Verification (KvG, BK, AR), pp. 178–194.
STOCSTOC-2014-Rothvoss #complexity #exponential
The matching polytope has exponential extension complexity (TR), pp. 263–272.
FSEFSE-2014-DingesA #heuristic
Solving complex path conditions through heuristic search on induced polytopes (PD, GAA), pp. 425–436.
ICALPICALP-v1-2013-AvisT #combinator #complexity #on the
On the Extension Complexity of Combinatorial Polytopes (DA, HRT), pp. 57–68.
ICALPICALP-v1-2013-BrunschR #algorithm
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm (TB, HR), pp. 279–290.
Polyhedral clinching auctions and the adwords polytope (GG, VSM, RPL), pp. 107–122.
KDIRKDIR-2012-LitvakV #summary
Polytope Model for Extractive Summarization (ML, NV), pp. 281–286.
SACSAC-2012-ShahidPO #bound
Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.
STOCSTOC-2011-AryaFM #approximate #query
Approximate polytope membership queries (SA, GDdF, DMM), pp. 579–586.
ICMLICML-2011-KamisettyXL #approximate #correlation #using
Approximating Correlated Equilibria using Relaxations on the Marginal Polytope (HK, EPX, CJL), pp. 1153–1160.
An invariance principle for polytopes (PH, AK, RM), pp. 543–552.
SACSAC-2010-FunfzigMF #polynomial
Polytope-based computation of polynomial ranges (CF, DM, SF), pp. 1247–1252.
STOCSTOC-2009-KannanN #linear #programming #random
Random walks on polytopes and an affine interior point method for linear programming (RK, HN), pp. 561–570.
Sherali-adams relaxations of the matching polytope (CM, AS), pp. 293–302.
CGOCGO-2009-CordesFM #abstract interpretation #analysis #modelling #performance #precise #slicing
A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models (PL, DC, HF, PM), pp. 136–146.
CCCC-2005-VerdoolaegeBBC #case study #experience #integer #parametricity
Experiences with Enumeration of Integer Projections of Parametric Polytopes (SV, KB, MB, FC), pp. 91–105.
STOCSTOC-1987-ChazelleEG #complexity
The Complexity of Cutting Convex Polytopes (BC, HE, LJG), pp. 66–76.
Probing Convex Polytopes (DPD, HE, CKY), pp. 424–432.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.