Abstract
In this highly readable article, Aiswarya takes a novel approach and reminds us of deep links between verification and the study of classes of graphs based on notions such as treewidth. Starting gently and providing ample examples, we are led to the state of the art and interesting open questions.
Recommendations
Column: Team Diagonalization
Ten years ago, Gla'er, Pavan, Selman, and Zhang [GPSZ08] proved that if P 6= NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite di erent potential consequence of NP-...
Verification column
The growing popularity of verification competitions such as VerifyThis Verification Competition and the Competition on Software Verification (SV-COMP), both, incentivize as well as reward tool developers. VerifyThis 2016 was held in Eindhoven colocated ...
Guest column: inapproximability results via Long Code based PCPs
Summer has come again. And what better way is there to spend a summer than to relax on a sandy beach, on a mountain top, or at a park's picnic tables, and... think theory! Summer is a particularly good time to attack the big questions whose openness ...
Comments