Abstract
There are two main results proved here. The first states that a certain set SP of strings (those coding “solvable path systems”) has tape complexity (log n)2 iff every set in Download : Download full-size image (i.e., of deterministic polynomial time complexity) has tape complexity (log n)2. The second result gives evidence that SP does not have tape complexity (log n)k for any k.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
