15 search results - page 3 / 3 » An Isomorphism between Subexponential and Parameterized Comp... |
LICS
1999
IEEE
14 years 25 days ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
FCT
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
CDC
2009
IEEE
13 years 12 months ago
2009
IEEE
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
APAL
2007
13 years 8 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
WWW
2003
ACM
14 years 9 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...