Sciweavers

145 search results - page 7 / 29
» Parameterized Complexity Classes under Logical Reductions
Sort
View
EVOW
2007
Springer
14 years 8 days ago
Dinucleotide Step Parameterization of Pre-miRNAs Using Multi-objective Evolutionary Algorithms
MicroRNAs (miRNAs) form a large functional family of small noncoding RNAs and play an important role as posttranscriptional regulators, by repressing the translation of mRNAs. Rece...
Jin-Wu Nam, In-Hee Lee, Kyu Baek Hwang, Seong-Bae ...
FOCS
2003
IEEE
14 years 1 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
ERSHOV
2003
Springer
14 years 1 months ago
The Translation Power of the Futamura Projections
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
Robert Glück
LPNMR
2009
Springer
14 years 2 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
APAL
2007
131views more  APAL 2007»
13 years 8 months ago
Bounded fixed-parameter tractability and reducibility
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...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...