2446 search results - page 107 / 490 » Choiceless Polynomial Time |
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
107
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
103
Voted
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
93
Voted
ESA
2007
Springer
15 years 6 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
105
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...