815 search results - page 2 / 163 » Where are the hard manipulation problems |
ATAL
2007
Springer
13 years 10 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
16
Voted
IPCO
1996
13 years 6 months ago
1996
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and ...
ISAAC
1993
Springer
13 years 8 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...