Sciweavers

29908 search results - page 54 / 5982
» On the Complexity of
Sort
View
EURODAC
1994
IEEE
112views VHDL» more  EURODAC 1994»
13 years 12 months ago
The use of semantic information for control of a complex routing tool
To handle increasingly complex design data, CAD tools are becoming more specialised and complex and hence, more difficult to use. This paper describes an interactive system that h...
Michael Brown, Nick Filer, Zahir Moosa
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
13 years 11 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
COCO
2006
Springer
65views Algorithms» more  COCO 2006»
13 years 11 months ago
An Isomorphism between Subexponential and Parameterized Complexity Theory
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
Yijia Chen, Martin Grohe
NETWORKING
2008
13 years 9 months ago
On the Robustness of Complex Networks by Using the Algebraic Connectivity
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
A. Jamakovic, Piet Van Mieghem
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
13 years 9 months ago
Complexities for generalized models of self-assembly
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang K...