4940 search results - page 70 / 988 » On the Complexity of Universal Programs |
107
click to vote
MFCS
1990
Springer
15 years 8 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
219
click to vote
IANDC
2008
15 years 4 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
112
click to vote
DAM
2002
15 years 4 months ago
2002
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
115
click to vote
DNA
2008
Springer
15 years 6 months ago
2008
Springer
The prospects of programming molecular systems to perform complex autonomous tasks has motivated research into the design of synthetic biochemical circuits. Of particular interest ...
138
click to vote
ATVA
2008
Springer
15 years 6 months ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...