2446 search results - page 121 / 490 » Choiceless Polynomial Time |
107
click to vote
CORR
2008
Springer
15 years 25 days ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
115
Voted
CORR
2006
Springer
15 years 23 days ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
ENTCS
2006
15 years 23 days ago
2006
We are concerned with programs composed of cooperative threads whose execution proceeds in synchronous rounds called instants. We develop static analysis methods to guarantee that...
MST
2007
15 years 7 days ago
2007
We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when t...