期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2001
卷号：2001
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：The paper presents a simple construction of polynomial length universal traversal sequences for cycles. These universal traversal sequences are log-space (even N C 1 ) constructible and are of length O ( n 4 03 ) . Our result improves the previously known upper-bound O ( n 4 76 ) for log-space constructible universal traversal sequences for cycles.
03 ) . Our result improves the previously known upper-bound O ( n 4 
