29 search results - page 2 / 6 » siamcomp 2000 |
SIAMCOMP
2000
14 years 11 months ago
2000
In this paper, we reexamine in the framework of robust computation the Bentley
SIAMCOMP
2000
14 years 11 months ago
2000
The main result is a finite-state version of the Kraft
101
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
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...
SIAMCOMP
2000
14 years 11 months ago
2000
-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...
SIAMCOMP
2000
14 years 11 months ago
2000
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...