Sciweavers

446 search results - page 12 / 90
» A Combinatorial Theorem for Trees
Sort
View
69
Voted
JCT
2006
60views more  JCT 2006»
14 years 9 months ago
A simple proof of Graham and Pollak's theorem
Graham and Pollak (Bell System Tech. J. 50 (1971) 2495-2519) obtained a beautiful formula on the determinant of distance matrices of trees, which is independent of the structure o...
Weigen Yan, Yeong-Nan Yeh
89
Voted
IJCAI
2003
14 years 11 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
ACL
1990
14 years 10 months ago
Polynomial Time Parsing of Combinatory Categorial Grammars
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
K. Vijay-Shanker, David J. Weir

Lecture Notes
638views
16 years 8 months ago
Game Theory Basics
These are game theory notes from LSE. They cover the following topics: Nim and combinatorial games, Games as trees and in strategic form, Mixed strategy equilibria, Game trees wit...
Bernhard von Stengel
78
Voted
RSA
2010
106views more  RSA 2010»
14 years 4 months ago
Thermodynamic limit for large random trees
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighb...
Yuri Bakhtin