1695 search results - page 108 / 339 » Linear, Polynomial or Exponential |
127
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
129
click to vote
ICASSP
2008
IEEE
15 years 11 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 ...
128
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
127
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
168
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...