Orientations Acycliques et le Polynôme Chromatique
✍ Scribed by Bodo Lass
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 239 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the set of minimax trees of a given order there can be defined two families of operations, the complements and the reverses. We study the actions of those operations and show that their orbits are enumerated by combinatorial objects previously introduced, such as the Hetyei-Reiner trees, the incr
## RCsumC. We develop a new method for showing lower bounds for the time-space tradeoff of polynomial evaluation procedures given by straight-line programs. By means of this method we prove an asymptotically sharp lower bound for the time-space tradeoff of general procedures of polynomial evaluati