Sciweavers

2412 search results - page 112 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
FOCS
2000
IEEE
15 years 7 months ago
Fast parallel circuits for the quantum Fourier transform
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...
Richard Cleve, John Watrous
ICCAD
1998
IEEE
76views Hardware» more  ICCAD 1998»
15 years 7 months ago
Functional debugging of systems-on-chip
Due to the exponential growth of both design complexity and the number of gates per pin, functional debugging has emerged as a critical step in the development of a system-on-chip...
Darko Kirovski, Miodrag Potkonjak, Lisa M. Guerra
JCM
2006
112views more  JCM 2006»
15 years 3 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
ICFEM
2010
Springer
15 years 1 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...
VCBM
2010
14 years 10 months ago
Adapted Surface Visualization of Cerebral Aneurysms with Embedded Blood Flow Information
Cerebral aneurysms are a vascular dilatation induced by a pathological change of the vessel wall and often require treatment to avoid rupture. Therefore, it is of main interest, t...
Rocco Gasteiger, Mathias Neugebauer, Christoph Kub...