1007 search results - page 70 / 202 » The Complexity of Futile Questioning |
133
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
131
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
107
Voted
KI
2007
Springer
15 years 10 months ago
2007
Springer
How do we reason about spatial descriptions? In recent years a lot of research has been investigated in order to determine factors of complexity in spatial relational reasoning. S...
123
Voted
WSC
2004
15 years 5 months ago
2004
From the perspective of flow analysis, the more complex the project, the more wastes are prone to build up, due to the increasing number of interfaces between activities. When pro...
133
Voted
DAM
2007
15 years 3 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...