| |
| 2008 | ||
|---|---|---|
| 2 | EE | Richard Chang, Suresh Purini: Amplifying ZPP^SAT[1] and the Two Queries Problem. IEEE Conference on Computational Complexity 2008: 41-52 |
| 2007 | ||
| 1 | EE | Richard Chang, Suresh Purini: Bounded Queries and the NP Machine Hypothesis. IEEE Conference on Computational Complexity 2007: 52-59 |
| 1 | Richard Chang | [1] [2] |