scientific article; zbMATH DE number 218387

zbMath0770.68058MaRDI QIDQ4694140

Larry J. Stockmeyer

Publication date: 29 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completetheory of computational complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

The deduction rule and linear and near-linear proof simulations, On the complexity of validity degrees in Łukasiewicz logic