scientific article; zbMATH DE number 1759419
From MaRDI portal
Publication:4536368
zbMath0996.68514MaRDI QIDQ4536368
Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
An inequality for polymatroid functions and its applications. ⋮ Incremental delay enumeration: space and time ⋮ Reducing the number of solutions of NP functions
This page was built for publication: