1007 search results - page 35 / 202 » The Complexity of Futile Questioning |
CJ
2008
13 years 9 months ago
2008
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...
ECCC
2007
13 years 9 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
KES
1998
Springer
14 years 1 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
ALT
2004
Springer
14 years 6 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...