Showing papers by "Juris Hartmanis published in 1990"
TL;DR: It is proved that robust machines squander their powerful nondeterministic oracle access in all relativizations—relative to any oracle A , their languages and properties can be computed in P NP A .
43 citations
13 Mar 1990
TL;DR: The scope and goals of structural complexity theory are discussed, some working hypothesis of this field is described and some recent developments are summarized.
Abstract: This paper discusses the scope and goals of structural complexity theory, describes some working hypothesis of this field and summarizes (some) recent developments.
23 citations
11 Jul 1990
TL;DR: This paper reviews the impact of some recent results on the research paradigms in structural complexity theory.
Abstract: This paper reviews the impact of some recent results on the research paradigms in structural complexity theory.
18 citations
01 May 1990
TL;DR: The width of a proof in a formal system $\cal F$ is defined and it is shown that it is an intuitively satisfying and robust definition and how quickly one can give overwhelming evidence that a theorem is provable without showing the full proof is seen.
Abstract: Very recently, it was shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of mathematical proofs. In this column, we define the width of a proof in a formal system $\cal F$ and show that it is an intuitively satisfying and robust definition. Then, using the IP = PSPACE result, it is seen that the width of a proof (as opposed to the length) determines how quickly one can give overwhelming evidence that a theorem is provable without showing the full proof.
6 citations
Proceedings Article•
01 Jul 1990
3 citations
Journal Article•
3 citations