2 papers
cs.LO2025
Quantum Programming in Polylogarithmic Time
Florent Ferrari, Emmanuel Hainry, Romain Péchoux +1
Polylogarithmic time delineates a relevant notion of feasibility on several classical computational models such as Boolean circuits or parallel random access machines. As far as th…
nlin.CD2010
Locking-time and Information Capacity in CML with Statistical Periodicity
Romeu Miqueias Szmoski, Rodrigo Frehse Pereira, Fabiano Alan Serafim Ferrari +1
In this work we address the statistical periodicity phenomenon on a coupled map lattice. The study was done based on the asymptotic binary patterns. The pattern multiplicity gives…