Tight Upper Bounds for Streett and Parity Complementation.
Yang CaiTing ZhangPublished in: CSL (2011)
Keyphrases
- upper bound
- lower bound
- worst case
- error correction
- tight bounds
- branch and bound algorithm
- branch and bound
- upper and lower bounds
- sample size
- error probability
- lower and upper bounds
- upper bounding
- vc dimension
- evolutionary algorithm
- efficiently computable
- linear programming
- np hard
- search algorithm
- optimal solution
- concept classes
- case study
- data sets
- database