1199 search results - page 16 / 240 » Parameterized Proof Complexity |
126
Voted
FCT
2011
Springer
14 years 2 months ago
2011
Springer
137
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
125
click to vote
LICS
2002
IEEE
15 years 7 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
138
Voted
AI
2008
Springer
15 years 1 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
110
Voted
FMCAD
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...