1380 search results - page 85 / 276 » A General Polynomial Sieve |
ECCC
2006
13 years 10 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...
MOC
1998
13 years 9 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 ...
ICALP
2011
Springer
13 years 1 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...
AAMAS
2012
Springer
12 years 5 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 ...
ECCC
2006
13 years 10 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...