CiteSeerX — Author Search Results

The History and Status of the P versus NP Question
by Michael Sipser, Juris Hartmanis — 1992
…this article, I have attempted to organize and describe this literature, including an occasional opinion about the most fruitful directions, but no technical details. In the first half of this century, work on the power of formal systems led to the formalization of the notion of algorithm and the re…
Cited by 29 (0 self) – Add To MetaCart

On IP = PSPACE and Theorems with Narrow Proofs
by Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi — 1990
…It has been 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 …
Add To MetaCart

Space Bounded Computations: Review And New Separation Results
by Desh Ranjan, Richard Chang, Juris Hartmanis — 1991 — Comput. Sci
…In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a slightly modified Turing machine model, low level deterministic and nondeterministic space bounded complexity classes are …
Cited by 3 (0 self) – Add To MetaCart

On IP=PSPACE and theorems with narrow proofs
by Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi — EATCS Bulletin
…It has been 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 …
Cited by 1 (0 self) – Add To MetaCart

Relativization: A revisionistic retrospective
by Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi — 1992 — Bulletin of the EATCS
…In this column we examine the role of relativization in complexity theory in light of recent non-relativizing results involving interactive protocols. We begin with the twice-told tale of the relativization principle and ponder upon its possible demise. Then, we discuss whether usual assumptions are…
Cited by 5 (0 self) – Add To MetaCart

Some observations about relativization of space bounded computations
by Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell — 1988 — Bulletin of the EATCS
…In this column we explore what relativization says about space bounded computations and what recent results about space bounded computations say about relativization. There is a strong belief in computational complexity circles that problems which can be relativized in two contradictory ways are ver…
Cited by 4 (1 self) – Add To MetaCart

The Random Oracle Hypothesis is False
by Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, Pankaj Rohatgi — 1994 — Journal of Computer and System Sciences
…The Random Oracle Hypothesis, attributed to Bennett and Gill, essentially states that the relationships between complexity classes which hold for almost all relativized worlds must also hold in the unrelativized case. Although this paper is not the first to provide a counterexample to the Random Ora…
Cited by 23 (2 self) – Add To MetaCart

Proceedings 13 Volume Editors
by Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, Jon M. Kleinberg, Alfred Kobsa, Friedemann Mattern, John C. Mitchell, C. Pandu Rangan, Bernhard Steffen, Demetri Terzopoulos, Doug Tygar, Gerhard Weikum, Myra Spiliopoulou (eds, Epaminondas Kapetanios, Vijayan Sugumaran, Myra Spiliopoulou
…Natural Language and…
Add To MetaCart

Rabin Measures
by Nils Klarlund, Dexter Kozen, Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, Tetsuo Asano, Vassos Hadzilacos, David Peleg, Laszl Babai, Juris Hartmanis, Andrew Pitts, Eric Bach, Maurice Herlihy, James Royer, Stephen Brookes, Stephen Homer, Alan Selman, Jin-yi Cai, Neil Immerman, Nir Shavit, Anne Condon, Paris Kanellakis, Eva Tardos, Cynthia Dwork, Howard Karlooe, Sam Toueg, Philip Klein, Moshe Vardi, Ronald Fagin, Phokion Kolaitis, Jennifer Welch — 1995
…Rabin conditions are a general class of properties of infinite sequences that encompass most known automata-theoretic acceptance conditions and notions of fairness. In this paper, we introduce a concept, called a Rabin measure, which in a precise sense expresses progress for each transition toward s…
Add To MetaCart

Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions
by Pankaj Agarwal, Joan Feigenbaum, Carsten Lund, and Peter W. Shor, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, Tetsuo Asano, Vassos Hadzilacos, David Peleg, Laszl Babai, Juris Hartmanis, Andrew Pitts, Eric Bach, Maurice Herlihy, James Royer, Stephen Brookes, Stephen Homer, Alan Selman, Jin-yi Cai, Neil Immerman, Nir Shavit, Anne Condon, Paris Kanellakis, Eva Tardos, Cynthia Dwork, Howard Karlooe, Sam Toueg, Philip Klein, Moshe Vardi, Ronald Fagin, Phokion Kolaitis, Jennifer Welch — 1995
…We initiate an investigation of probabilistically checkable debate systems (PCDS), a natural generalization of probabilistically checkable proof systems (PCPS). A PCDS for a language L consists of a probabilistic polynomial-time verifier V and a debate between player 1, who claims that the input x i…
Add To MetaCart

Searching for authors named Juris Hartmanis – sorted by Relevance.