10 citations · 24 across the 9 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2023
Superpositioner -- A non-logical computation model
Chuyu Xiong
We have been striving to exceed computational complexity, and in the process, we have come to realize the dilemma of classical computing, and in turn we realize that superpositione…
cs.CC2022
Exceeding Computational Complexity Trial-and-Error Dynamic Action and Intelligence
Chuyu Xiong
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to…
cs.CC2021
Sampling and Complexity of Partition Function
Chuyu Xiong
The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to…