1199 search results - page 4 / 240 » Parameterized Proof Complexity |
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
APAL
2006
13 years 7 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
IJFCS
2008
13 years 7 months ago
2008
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...