On being incoherent without being very hard Richard BeigelJoan Feigenbaum OriginalPaper Pages: 1 - 17
Polynomial-time compression Judy GoldsmithKenneth KunenLane A. Hemachandra OriginalPaper Pages: 18 - 39
The quantifier structure of sentences that characterize nondeterministic time complexity James F. Lynch OriginalPaper Pages: 40 - 66
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields Mohammad A. Shokrollahi OriginalPaper Pages: 67 - 96