2957 search results - page 152 / 592 » The Complexity of Polynomial-Time Approximation |
132
Voted
ECCC
2006
15 years 5 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
171
Voted
JCSS
2010
15 years 3 months ago
2010
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
132
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
143
Voted
LATIN
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
147
click to vote
CROSSROADS
2007
15 years 5 months ago
2007
We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...