| Issue |
RAIRO-Theor. Inf. Appl.
Volume 34, Number 2, March/April 2000
|
|
|---|---|---|
| Page(s) | 131 - 138 | |
| DOI | https://doi.org/10.1051/ita:2000110 | |
| Published online | 15 April 2002 | |
Three generators for minimal writing-space computations
1
Département de Mathématiques et d'Informatique,
15 avenue René Cassin, Université de la Réunion, 97490 Saint-Denis, France;
(burckel@univ-reunion.fr)
2
Département de Mathématiques et d'Informatique,
15 avenue René Cassin, Université de la Réunion, 97490 Saint-Denis, France;
(mar@univ-reunion.fr)
Received:
14
June
1999
Accepted:
18
April
2000
We construct, for each integer n, three functions from {0,1}n to {0,1} such that any boolean mapping from {0,1}n to {0,1}n can be computed with a finite sequence of assignations only using the n input variables and those three functions.
Mathematics Subject Classification: 68Q / 06E30 / 03D15
Key words: Boolean functions / models of computations.
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.