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:
algorithm (5)
time (3)
hierarchi (2)
simplex (2)
code (2)

Stem subexponenti$ (all stems)

12 papers:

CSLCSL-2013-GhasemlooC #bound #proving
Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.
STOCSTOC-2011-FriedmannHZ #algorithm #bound #random
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
ICSTSAT-2011-DantsinH #satisfiability
Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.
CSLCSL-2010-Chaudhuri #logic
Classical and Intuitionistic Subexponential Logics Are Equally Expressive (KC), pp. 185–199.
3-query locally decodable codes of subexponential length (KE), pp. 39–44.
PPDPPPDP-2009-NigamM #algorithm #linear #logic #specification
Algorithmic specifications in linear logic with subexponentials (VN, DM), pp. 129–140.
STOCSTOC-2007-Yekhanin #towards
Towards 3-query locally decodable codes of subexponential length (SY), pp. 266–274.
ICALPICALP-2007-DornFT #algorithm
Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.
CSLCSL-2007-ChenF #parametricity
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping (YC, JF), pp. 389–404.
ICALPICALP-2001-CaiJ #algorithm
Subexponential Parameterized Algorithms Collapse the W-Hierarchy (LC, DWJ), pp. 273–284.
STOCSTOC-1999-KlivansM #graph #morphism #polynomial #proving
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (AK, DvM), pp. 659–667.
STOCSTOC-1992-Kalai #algorithm #random
A Subexponential Randomized Simplex Algorithm (Extended Abstract) (GK), pp. 475–482.

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.