1 citations · 1 across the 4 of their papers we have counts for
4 papers
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals
Xin Tong, Yixiao Yu, Ziyi Fang +4
Sorting a permutation by reversals is a famous problem in genome rearrangements. Since 1997, quite some biological evidence were found that in many genomes the reversed regions are…
A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices
Xingfu Li, Daming Zhu
This paper focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a…
Implementing program extraction from CL1-proofs
Meixia Qu, Ke Chen, Daming Zhu +1
Computability logic (CoL) is a formal theory of interactive computation. It understands computational problems as games played by two players: a machine and its environment, uses l…
On the toggling-branching recurrence of Computability Logic
Meixia Qu, Junfeng Luan, Daming Zhu
We introduce a new, substantially simplified version of the toggling-branching recurrence operation of Computability Logic, prove its equivalence to Japaridze's old, "canonical" ve…