360 search results - page 12 / 72 » Explanations and Proof Trees |
COMBINATORICS
1998
14 years 11 months ago
1998
A q-Lagrange inversion theorem due to A. M. Garsia is proved by means of two sign-reversing, weight-preserving involutions on Catalan trees.
104
click to vote
CG
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
109
click to vote
EVOW
2010
Springer
15 years 6 months ago
2010
Springer
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...