1092 search results - page 106 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
164
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
179
click to vote
ICAI
2004
15 years 7 months ago
2004
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
171
click to vote
DAM
2007
15 years 6 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
176
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
168
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...