2446 search results - page 19 / 490 » Choiceless Polynomial Time |
IFIP
2004
Springer
14 years 26 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
SAS
2005
Springer
14 years 29 days ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...