154 search results - page 6 / 31 » Using Proofs by Coinduction to Find |
COMBINATORICS
2006
13 years 8 months ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
IANDC
2010
13 years 6 months ago
2010
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
JACM
2006
13 years 7 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
JLP
2010
13 years 2 months ago
2010
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
DCG
2000
13 years 7 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...