research
∙
08/18/2023
Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization
In this paper, we extend the techniques used in our previous work to sho...
share
research
∙
09/21/2022
Model-Checking Branching-Time Properties of Stateless Probabilistic Pushdown Systems and Its Quantum Extension
In this work, we first resolve a question in the probabilistic verificat...
research
∙
12/07/2021
On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier
This work analysis the so-called "Relativization Barrier" with respect t...
research
∙
10/12/2021
Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine
The diagonalization technique was invented by Georg Cantor to show that ...
research
∙
10/11/2021
Resolution of the Linear-Bounded Automata Question
This work resolve a longstanding open question in automata theory, i.e. ...
research
∙
06/22/2021
A Negative Answer to P?=PSPACE
There is a conjecture on P?=PSPACE in computational complexity zoo. It i...
research
∙
03/22/2020