Stem subexponenti$ (all stems)

12 papers:

CSL-2013-GhasemlooC #bound #proving

Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.

STOC-2011-FriedmannHZ #algorithm #bound #random

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.

SAT-2011-DantsinH #satisfiability

Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.

CSL-2010-Chaudhuri #logic

Classical and Intuitionistic Subexponential Logics Are Equally Expressive (KC), pp. 185–199.

STOC-2009-Efremenko

3-query locally decodable codes of subexponential length (KE), pp. 39–44.

PPDP-2009-NigamM #algorithm #linear #logic #specification

Algorithmic specifications in linear logic with subexponentials (VN, DM), pp. 129–140.

STOC-2007-Yekhanin #towards

Towards 3-query locally decodable codes of subexponential length (SY), pp. 266–274.

ICALP-2007-DornFT #algorithm

Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.

CSL-2007-ChenF #parametricity

Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping (YC, JF), pp. 389–404.

ICALP-2001-CaiJ #algorithm

Subexponential Parameterized Algorithms Collapse the W-Hierarchy (LC, DWJ), pp. 273–284.

STOC-1999-KlivansM #graph #morphism #polynomial #proving

Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (AK, DvM), pp. 659–667.

STOC-1992-Kalai #algorithm #random

A Subexponential Randomized Simplex Algorithm (Extended Abstract) (GK), pp. 475–482.