scientific article; zbMATH DE number 1884382
From MaRDI portal
Publication:4799291
zbMath1007.68512MaRDI QIDQ4799291
Lefteris M. Kirousis, Phokion G. Kolaitis
Publication date: 18 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2173/21730042.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Trichotomies in the complexity of minimal inference ⋮ Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents
