This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...