Sciweavers

Share
CORR
1999
Springer
95views Education» more  CORR 1999»
8 years 11 months ago
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
Jörg Flum, Martin Grohe
SIAMCOMP
2008
84views more  SIAMCOMP 2008»
8 years 11 months ago
Resolution Is Not Automatizable Unless W[P] Is Tractable
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
Michael Alekhnovich, Alexander A. Razborov
CJ
2008
69views more  CJ 2008»
8 years 11 months ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
9 years 3 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
IWPEC
2004
Springer
9 years 4 months ago
Parameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Dániel Marx
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
9 years 8 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICML
2002
IEEE
10 years 4 days ago
Active + Semi-supervised Learning = Robust Multi-View Learning
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
Ion Muslea, Steven Minton, Craig A. Knoblock
books