2200 search results - page 264 / 440 » Bloch's Constant is Computable |
168
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We consider two-party quantum protocols starting with a transmission of some random BB84 qubits followed by classical messages. We show a general “compiler” improving the secur...
179
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
174
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
The size of supercomputers in numbers of processors is growing exponentially. Today’s largest supercomputers have upwards of a hundred thousand processors and tomorrow’s may ha...
193
click to vote
ICIC
2009
Springer
16 years 1 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
141
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...