scientific article; zbMATH DE number 6292595

From MaRDI portal

Revision as of 02:19, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5414565

Jump to:navigation, search

DOI10.4086/cjtcs.2008.003zbMath1286.68216OpenAlexW4252008346MaRDI QIDQ5414565

Prabhu Manyem

Publication date: 6 May 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2008.003

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

zbMATH Keywords

optimization finite model theory existential second-order logic descriptive complexity quantifier complexity quantifier alternation syntactic hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (1)

Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5414565&oldid=20165109"