Sciweavers

2479 search results - page 133 / 496
» Quantum complexity theory
Sort
View
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
15 years 11 months ago
Separation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
Aduri Pavan, Alan L. Selman
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
CN
2010
120views more  CN 2010»
15 years 7 months ago
A survey on bio-inspired networking
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sen...
Falko Dressler, Özgür B. Akan
CCGRID
2011
IEEE
14 years 10 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
FSE
2009
Springer
107views Cryptology» more  FSE 2009»
16 years 1 months ago
Multidimensional Extension of Matsui's Algorithm 2
Matsui’s one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on estab...
Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg