Sciweavers

13621 search results - page 110 / 2725
» Computability and Complexity in Self-assembly
Sort
View
CAV
2009
Springer
104views Hardware» more  CAV 2009»
14 years 10 months ago
SPEED: Symbolic Complexity Bound Analysis
The SPEED project addresses the problem of computing symbolic computational complexity bounds of procedures in terms of their inputs. We discuss some of the challenges that arise a...
Sumit Gulwani
IFIPTCS
2010
13 years 8 months ago
Initial Segment Complexities of Randomness Notions
Schnorr famously proved that Martin-L
Rupert Hölzl, Thorsten Kräling, Frank St...
ICS
2010
Tsinghua U.
14 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
ARITH
2003
IEEE
14 years 3 months ago
On-Line Multiplication in Real and Complex Base
Multiplication of two numbers represented in base   is shown to be computable by an on-line algorithm when   is a negative integer, a positive non-integer real number, or a comp...
Christiane Frougny, Athasit Surarerks
CHI
2010
ACM
14 years 1 months ago
Sawtooth: interactive clarity and aesthetic complexity
Sawtooth (2009) is an artwork integrating performance, sound, and animation. This paper describes the design of Sawtooth, with particular reference to the balances it strikes betw...
Christopher Burns