An affine analogue of Wilbrink's theorem
β Scribed by Alexander Pott
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 140 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One of the best-known results of extremal combinatorics is Sperner's theorem, which asserts that the maximum size of an antichain of subsets of an n-element set equals the binomial coefficient n n/2 , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner's theorem has
Rice's Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect a