Izv. Vyssh. Uchebn. Zaved. Mat., 2005 Number 11, Pages 34–43
(Mi ivm103)
|
The capabilities of probabilistic ordered read-$k$-times binary programs and deterministic read-once binary programs are incomparable
R. G. Mubarakzyanov Kazan State University
UDC:
519.714 Received: 27.12.2004
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2005,
49:11,
32–40
Bibliographic databases:
© , 2024
Fulltext:
PDF file (237 kB)