2661 search results - page 378 / 533 » Quantum Complexity Classes |
136
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
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...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
149
Voted
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
While video-based activity analysis and recognition has received much attention, existing body of work mostly deals with single object/person case. Coordinated multi-object activi...
123
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...
144
Voted
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...