| viXra.org > Data Structures and Algorithms > viXra:2003.0680 |
 |
 |
| viXra.org > Data Structures and Algorithms > viXra:2003.0680 |
|
|
Data Structures and Algorithms |
|
Authors: Luowen Qian
In this work, we introduce the nonuniform complexity class LD, which stands for linear depth circuit. We also prove that LD = ALL, which is the complexity class that contains all decision languages, and therefore resolving all questions on this new complexity class. No further research is needed [Mun20]. In principle, this shows that anything can be computed via circuits in linear time, despite with (possibly undecidable) pre-computation and very inefficient advice, however, we note that exponential sized advice suffices to achieve ALL.
Comments: 2 Pages.
Download: PDF
[v1] 2020-03-31 18:53:56
Unique-IP document downloads: 456 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|