451 search results - page 29 / 91 » On Parameterized Exponential Time Complexity |
AAAI
2008
14 years 6 days ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
IPL
2007
13 years 9 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
CMSB
2008
Springer
13 years 11 months ago
2008
Springer
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
ESA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...