2233 search results - page 47 / 447 » On the Complexity of Theory Curbing |
ISSAC
2004
Springer
15 years 7 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
102
click to vote
AAMAS
2002
Springer
15 years 1 months ago
2002
Springer
The evolution of collaboration and communication in communities of individuals is a puzzling problem for a wide range of scientific disciplines, spanning from evolutionary theory ...
APAL
2004
15 years 1 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...
126
click to vote
SAGT
2010
Springer
15 years 10 days 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...
128
click to vote
SAGT
2010
Springer
15 years 10 days 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...