1554 search results - page 163 / 311 » Parameterized Complexity and Approximation Algorithms |
125
click to vote
MOR
2006
15 years 3 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
118
click to vote
IACR
2011
14 years 3 months ago
2011
Linear cryptanalysis, along with differential cryptanalysis, is an important tool to evaluate the security of block ciphers. This work introduces a novel extension of linear crypt...
132
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
146
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
128
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...