An Upper Bound on Checking Test Complexity for Almost All Cographs.
Oleg V. ZubkovDmitry V. ChistikovAndrey A. VoronenkoPublished in: SYNASC (2011)
Keyphrases
- upper bound
- worst case
- lower bound
- branch and bound
- np hard
- computational cost
- statistical tests
- branch and bound algorithm
- sample size
- upper and lower bounds
- complexity analysis
- statistical significance
- space complexity
- memory requirements
- test data
- information retrieval
- computational complexity
- multi agent
- bayesian networks
- training data