2 papers
cs.CC2024
A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
Naoaki Okada, Shuji Kijima
This work is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the -th bit of a bit sequence generated by a…
cs.CC2023
The Space Complexity of Generating Tent Codes
Naoaki Okada, Shuji Kijima
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it possible to get the -th bit of a bit sequence generated by…