| Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets | SIAM Journal on Computing |
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
- Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
- Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
| 50 | 1991 |
| 10.1007/BF01202282 | | | | |
| 10.1007/978-3-642-75357-2 | | | | |
| 10.1007/978-3-642-75357-2 | | | | |
| On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets | SIAM Journal on Computing |
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
- Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
- Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
| 31 | 1983 |