145 search results - page 5 / 29 » Parameterized Complexity Classes under Logical Reductions |
IANDC
2008
13 years 8 months ago
2008
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
TARK
2005
Springer
14 years 1 months ago
2005
Springer
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
LPAR
2007
Springer
14 years 2 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...