Tianrong Lin

13 papers Journal 13

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Computational Complexity of Model-Checking Quantum Pushdown Systems. CoRR Deren Lin, Tianrong Lin
2024	J	`jnl`	Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines. CoRR Tianrong Lin
2023	J	`jnl`	Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization. CoRR Tianrong Lin
2022	J	`jnl`	On Probabilistic ω-Pushdown Systems, and ω-Probabilistic Computational Tree Logic. CoRR Tianrong Lin
2021	J	`jnl`	Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine. CoRR Tianrong Lin
2021	J	`jnl`	On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier. CoRR Tianrong Lin
2021	J	`jnl`	Resolution of The Linear-Bounded Automata Question. CoRR Tianrong Lin
2021	J	`jnl`	The Separation of NP and PSPACE. CoRR Tianrong Lin
2015	J	`jnl`	Corrigendum to "Another approach to the equivalence of measure-many one-way quantum infinite automata and its application" [J. Comput. Syst. Sci. 78(3) (2012) 807-821]. J. Comput. Syst. Sci. Tianrong Lin
2014	J	`jnl`	Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems. CoRR Tianrong Lin
2012	J	`jnl`	Another approach to the equivalence of measure-many one-way quantum finite automata and its application. J. Comput. Syst. Sci. Tianrong Lin
2011	J	`jnl`	Another approach of the equivalence problem for measure-many one-way quantum finite automata CoRR Tianrong Lin
2011	J	`jnl`	On commutativity of quantum weakest preconditions CoRR Tianrong Lin