scientific article; zbMATH DE number 1398073
From MaRDI portal
Publication:4937194
zbMath0939.68657MaRDI QIDQ4937194
Publication date: 3 February 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Polynomial-time computable stable models ⋮ An incremental algorithm for generating all minimal models
This page was built for publication:
