A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains.
Matthias BeckThomas ZaslavskyPublished in: J. Comb. Theory, Ser. A (2002)
Keyphrases
- upper bound
- lower bound
- theorem prover
- theorem proving
- lower and upper bounds
- tight bounds
- average case
- upper and lower bounds
- databases
- geometry theorem proving
- algorithms for data mining
- linear logic
- database
- worst case
- decision trees
- knowledge base
- automated theorem proving
- learning algorithm
- interactive theorem proving