共 50 条
- [24] Randomized algorithm for finding a near-maximum clique and its experimental evaluations Systems and Computers in Japan, 1994, 25 (02): : 1 - 7
- [27] The Worst Case Complexity of Maximum Parsimony COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 79 - 88
- [28] Time complexity and input design in worst-case identification using binary sensors PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2007, : 2681 - 2686