scientific article
From MaRDI portal
Publication:3484326
zbMath0704.68004MaRDI QIDQ3484326
No author found.
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
On the approximability of the maximum common subgraph problem ⋮ On sets polynomially enumerable by iteration ⋮ Finding optimal derivation strategies in redundant knowledge bases ⋮ Quantifiers and approximation ⋮ Completeness in approximation classes
This page was built for publication:
