145 search results - page 17 / 29 » Parameterized Complexity Classes under Logical Reductions |
LOGCOM
2007
13 years 8 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
DNA
2009
Springer
14 years 3 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
ENTCS
2007
13 years 8 months ago
2007
The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations usi...