Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Chang, Richard - Institute for Advanced Computer Studies & Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County
Bounded Query Functions with Limited Output Bits Richard Chang
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
A Relationship between Difference Hierarchies and Relativized Polynomial Hierarchies
An Example of a Theorem that has Contradictory Relativizations and a Diagonalization Proof
Relativization: a Revisionistic Retrospective Juris Hartmanis Richard Chang
1 Commutative Queries 2 Richard Beigel
Space Bounded Computations: Review And New Separation Results
The Random Oracle Hypothesis is False Richard Chang1,2
ON THE STRUCTURE OF NP COMPUTATIONS UNDER BOOLEAN OPERATORS
Connecting the Complexities of Approximating Clique and TSP Richard Chang
Amplifying ZPPSAT[1] and the Two Queries Problem Richard Chang Suresh Purini
Bounded Queries and the NP Machine Hypothesis Richard Chang
Bounded Queries, Approximations and the Boolean Hierarchy Richard Chang
A MACHINE MODEL FOR THE COMPLEXITY OF NP-APPROXIMATION PROBLEMS
On the Query Complexity of Clique Size and Maximum Satisfiability
ON THE STRUCTURE OF BOUNDED QUERIES TO ARBITRARY NP SETS
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions
On Unique Satisfiability and Randomized Reductions Richard Chang
On IP = PSPACE and Theorems with Narrow Proofs Juris Hartmanis Richard Chang
Some Observations about Relativization of Space Bounded Computations
On Computing Boolean Connectives of Characteristic Functions Richard Chang
On Bounded Queries and Approximation Richard Chang
One Bit of Advice Harry Buhrman
