2479 search results - page 93 / 496 » Quantum complexity theory |
137
click to vote
APAL
2004
15 years 6 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
177
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
187
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
160
click to vote
CP
2011
Springer
14 years 6 months ago
2011
Springer
In recent models of decision-making, cognitive scientists have examined the relationship between option generation and successful performance. These models suggest that those who a...
154
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...