1380 search results - page 85 / 276 » A General Polynomial Sieve |
193
click to vote
ECCC
2006
15 years 6 months ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
143
click to vote
MOC
1998
15 years 6 months ago
1998
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
256
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
212
click to vote
AAMAS
2012
Springer
14 years 2 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
181
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...