493 search results - page 49 / 99 » Quantum Query Complexity of Some Graph Problems |
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
PPAM
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
ECCC
2008
14 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
P2P
2005
IEEE
15 years 3 months ago
2005
IEEE
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...