共 30 条
- [1] Sparse selfreducible sets and polynomial size circuit lower bounds [J]. STACS 2006, PROCEEDINGS, 2006, 3884 : 455 - 468
- [2] ON CONSTRUCTIVELY NON-MORPHISMS OF ENUMERATED SETS AND CONSTRUCTIVE NON-REDUCIBILITY OF ENUMERATIONS [J]. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1987, 33 (06): : 485 - 496
- [3] Sparse Selfreducible Sets and Nonuniform Lower Bounds [J]. ALGORITHMICA, 2019, 81 (01) : 179 - 200
- [5] Lower bounds on the size of test data sets [J]. ADVANCED TOPICS IN ARTIFICIAL INTELLIGENCE, 1998, 1502 : 227 - 237
- [6] Hardness of Sparse Sets and Minimal Circuit Size Problem [J]. COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 484 - 495
- [8] Upper and lower bounds on the size of Bk[g] sets [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2022, 83 : 129 - 140
- [9] Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size [J]. APPROXIMATION RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2008, 5171 : 276 - 289