scientific article
From MaRDI portal
Publication:3340149
zbMath0548.68041MaRDI QIDQ3340149
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycomplete setscompact descriptioncounting polynomial-time hierarchydescriptional languagesfinite sets of natural numbersfinite sets of rectanglesproperties of finite sets
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Hierarchies of computability and definability (03D55)
This page was built for publication:
