Richard Chang On the Structure of Bounded Queries to Arbitrary NP Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:250-258 [Conf]
Richard Chang On the Query Complexity of Clique Size and Maximum Satisfiability. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:31-42 [Conf]
Richard Chang, Jim Kadin The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:169-178 [Conf]
Richard Chang, Jim Kadin, Pankaj Rohatgi Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:255-269 [Conf]
Richard Chang An Example of a Theorem that has Contradictory Relativization and Diagonalization Proof. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1990, v:42, n:, pp:172-173 [Journal]
Richard Chang A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1994, v:54, n:, pp:166-183 [Journal]
Richard Chang Bounded Queries, Approximations, and the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:169, n:2, pp:129-159 [Journal]
Richard Chang On the Query Complexity of Clique Size and Maximum Satisfiability. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:2, pp:298-313 [Journal]
Richard Chang On the Structure of Bounded Queries to Arbitrary NP Sets. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:4, pp:743-754 [Journal]