共 47 条
- [33] A note on closeness betweenNP-hard sets andC=P Journal of Computer Science and Technology, 2000, 15 : 194 - 195
- [35] Expert Knowledge Is Needed for Design under Uncertainty: For p-Boxes, Backcalculation is, in General, NP-Hard 2009 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, 2009, : 427 - 431
- [36] ON POLYNOMIAL-TIME TRUTH-TABLE REDUCIBILITY OF INTRACTABLE SETS TO P-SELECTIVE SETS MATHEMATICAL SYSTEMS THEORY, 1991, 24 (02): : 69 - 82
- [37] Sparse hard sets for P yield space-efficient algorithms CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1996, (02): : 1 - 13
- [40] Banach spaces in which weakly p-Dunford–Pettis sets are relatively compact Monatshefte für Mathematik, 2020, 191 : 719 - 733