2680 search results - page 94 / 536 » The topology of the independence complex |
112
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
119
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--This paper centers on the limit eigenvalue distribution for random Vandermonde matrices with unit magnitude complex entries. The phases of the entries are chosen independ...
109
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...