2957 search results - page 135 / 592 » The Complexity of Polynomial-Time Approximation |
192
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
165
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
198
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
145
Voted
ENDM
2008
15 years 5 months ago
2008
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
150
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...