Sciweavers

165 search results - page 24 / 33
» Exotic Quantifiers, Complexity Classes, and Complete Problem...
Sort
View
STACS
2010
Springer
14 years 2 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
Bireswar Das, Jacobo Torán, Fabian Wagner
CAV
2010
Springer
206views Hardware» more  CAV 2010»
13 years 10 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl
AI
2008
Springer
13 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 7 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 1 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett