1199 search results - page 171 / 240 » Parameterized Proof Complexity |
VMCAI
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
SIGECOM
2006
ACM
14 years 2 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
FPT
2005
IEEE
14 years 2 months ago
2005
IEEE
Designing Systems on-Chip is becoming increasingly popular as die sizes increase and technology sizes decrease. The complexity of integrating different types of Processing Element...
DALT
2004
Springer
14 years 2 months ago
2004
Springer
Declarative modelling approaches in principle assume a notion of representation or representational content for the modelling concepts. The notion of representational content as di...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...