scientific article
From MaRDI portal
Publication:3348901
zbMath0727.03025MaRDI QIDQ3348901
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
classification of the prefix vocabulary classes in P and in NPcomplexity of deciding satisfiability of formulas in full first order logic
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication:
