Proceedings 13 Volume Editors (2009)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Natural Language and
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks....
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Relevance Feedback for Sketch Retrieval Based on Linear Programming Classification (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, ...
Abstract. Relevance feedback plays as an important role in sketch retrieval as it does in existing content-based retrieval. This paper presents a method of relevance feedback for sketch retrieval by...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
On IP=PSPACE and theorems with narrow proofs (2008)
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
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...
The Structural Complexity Column by (2008)
One of the Grand Challenges to computer science is to understand what is and is not feasibly computable. Recursive function theory clarified what is and is not effectively computable and in the...
On the Weak mod m Representation of Boolean Functions (2007)
Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, ...
one article at a time in L ATEX source form on the Internet. Pagination
Commenced Publication in 1973 Founding and Former Series Editors: (2006)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Pilar Herrero et al. (Eds.) On the Move to Meaningful Internet Systems 2006:
Some embedding theorems for lattices (2003)
In this thesis we give a general definition of a geometry on a set S and consider the lattices of the subspaces of these geometries. First, we show that all such geometries on a fixed set S form a...
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Proceedings
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Proceedings
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Proceedings
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Femke van Raamsdonk Roel de Vrijer (Eds.)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks....
The Random Oracle Hypothesis is False (1997)
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, ...
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...
Richard Chang, Juris Hartmanis, Desh Ranjan, Pankaj Rohatgi
1 Introduction Computational complexity theory studies the quantitative laws which govern computing. It seeks a comprehensive classification of problems by their intrinsic difficulty and an...
Symmetric Logspace is Closed Under Complement (1995)
Noam Nisan, Abadi Greg, Frederickson John Mitchell, Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, ...
We present a Logspace, many-one reduction from the undirected Abstract-1 st connectivity problem to its complement. This shows that SL = coSL. 1 Introduction This paper deals with the complexity...
On the Weak mod m Representation of Boolean Functions (1995)
Vince Grolmusz, Abadi Greg, Frederickson John Mitchell, Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, ...
Let P be a polynomial over the ring of mod m integers. P weakly represents Boolean function f : f0; 1g n ! f0; 1g if there is a subset S ` f0; 1; : : : ; m \Gamma 1g such that f(x) = 0 if and only if...
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions (1995)
Pankaj Agarwal, Joan Feigenbaum, Carsten Lund, Andrew Goldberg, Ketan Mulmuley, ...
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...
Nils Klarlund, Dexter Kozen, Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, ...
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...
Symmetric Logspace is Closed under Complement (1995)
Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, ...
We present a Logspace, many-one reduction from the undirected Abstract-1 s--t connectivity problem to its complement. This shows that SL = coSL.
[ii] Chicago Journal of Theoretical Computer Science 1995-3Rabin Measures (1995)
Pankaj Agarwal, Andrew Goldberg, Ketan Mulmuley, Eric Allender, Georg Gottlob, Gil Neiger, ...
Published one article at a time in LATEX source form on the Internet. Pagination
A machine model for NP-approximation problems and the revenge of the Boolean hierarchy (1994)
Juris Hartmanis, Richard Chang
This column addresses the following questions about the complexity of approximating the CLIQUE problem. 1. Is finding the vertices of the largest clique more difficult than merely finding the...
The Random Oracle Hypothesis is False (1994)
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, ...
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...
The Random Oracle Hypothesis is False (1994)
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Hastad, Desh Ranjan, ...
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...
On the Intellectual Terrain Around NP (1993)
Hartmanis, Juris, Chari, Suresh
In this paper, we view $P \stackrel{?}{=} NP$ as the problem which symbolizes the attempt to understand what is and what is not feasibly computable. The paper shortly reviews the history of the...
On the Intellectual Terrain Around NP (1993)
Hartmanis, Juris, Chari, Suresh
In this paper, we view $P \stackrel{?}{=} NP$ as the problem which symbolizes the attempt to understand what is and what is not feasibly computable. The paper shortly reviews the history of the...
Recent Progress in Information-Based Complexity (1993)
Juris Hartmanis, H. Wozniakowski, J.F. Traub, H. Wo Zniakowski
this article is to report some of the recent progress in information-based complexity, which for brevity will be denoted as IBC. We have selected topics which might be of particular interest to the...
The History and Status of the P versus NP Question (1992)
Michael Sipser, Juris Hartmanis
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...
Relativization: A revisionistic retrospective (1992)
Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi
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...
Space Bounded Computations: Review And New Separation Results (1991)
Desh Ranjan, Richard Chang, Juris Hartmanis
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...
Space bounded computations: Review and new separation results (1991)
Desh Ranjan, Richard Chang, Juris Hartmanis
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...
On IP=PSPACE and Theorems with Narrow Proofs (1990)
Hartmanis, Juris, Chang, Richard, Ranjan, Desh, Rohatgi, Pankaj
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...
On IP=PSPACE and Theorems with Narrow Proofs (1990)
Hartmanis, Juris, Chang, Richard, Ranjan, Desh, Rohatgi, Pankaj
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...
Structural Complexity Theory: Recent Surprises (1990)
Hartmanis, Juris, Chang, Richard, Ranjan, Desh, Rohatgi, Pankaj
This paper reviews the impact of some recent results on the research paradigms in structural complexity theory.
Structural Complexity Theory: Recent Surprises (1990)
Hartmanis, Juris, Chang, Richard, Ranjan, Desh, Rohatgi, Pankaj
This paper reviews the impact of some recent results on the research paradigms in structural complexity theory.
On IP = PSPACE and Theorems with Narrow Proofs (1990)
Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
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...
The random oracle hypothesis is false (1990)
Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Desh Ranjan, Pankaj Rohatgi
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...
Space Bounded Computations: Review And New Separation Results (1989)
Hartmanis, Juris, Ranjan, Desh
In this paper, we review the key results about space bounded complexity classes, discuss the central open problems and outline the relevant proof techniques. We show that, for a slightly modified...
Space Bounded Computations: Review And New Separation Results (1989)
Hartmanis, Juris, Ranjan, Desh
In this paper, we review the key results about space bounded complexity classes, discuss the central open problems and outline the relevant proof techniques. We show that, for a slightly modified...
Godel, von Neumann and the P=?NP Problem (1989)
In a 1956 letter, Godel asked von Neumann about the computational complexity of an NP complete problem. In this column, we review the historic setting of this period, discuss Godel's amazing letter...
Godel, von Neumann and the P=?NP Problem (1989)
In a 1956 letter, Godel asked von Neumann about the computational complexity of an NP complete problem. In this column, we review the historic setting of this period, discuss Godel's amazing letter...
On the Importance of Being II2-Hard (1989)
In this column, we show how a variety of interesting results in theory of computation all follow from a simple observation about $\prod _{2}$-complete sets of total machines. We easily derive: a)...
On the Importance of Being II2-Hard (1989)
In this column, we show how a variety of interesting results in theory of computation all follow from a simple observation about $\prod _{2}$-complete sets of total machines. We easily derive: a)...
NO ABSTRACT AVAILABLE
NO ABSTRACT AVAILABLE
New Developments in Structural Complexity Theory (1988)
This paper discusses the scope and goals of structural complexity theory, describes some working hypothesis of this field and summarizes (some) recent development.
New Developments in Structural Complexity Theory (1988)
This paper discusses the scope and goals of structural complexity theory, describes some working hypothesis of this field and summarizes (some) recent development.
Some observations about relativization of space bounded computations (1988)
Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell
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...
Abstract not Available
Abstract not Available
Some Observations About NP Complete Sets (1987)
In this paper we summarize and extend some recent results about the properties of NP complete sets and related results about the structure of feasible computations.
Some Observations About NP Complete Sets (1987)
In this paper we summarize and extend some recent results about the properties of NP complete sets and related results about the structure of feasible computations.
Complexity Classes Without Machines: On Complete Languages for UP (1986)
Hartmanis, Juris, Hemachandra, Lane A.
This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection...
Complexity Classes Without Machines: On Complete Languages for UP (1986)
Hartmanis, Juris, Hemachandra, Lane A.
This paper develops techniques for studying complexity classes that are not covered by known recursive enumerations of machines. Often, counting classes, probabilistic classes, and intersection...
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets (1986)
Hartmanis, Juris, Hemachandra, Lane A.
This paper 1. gives a relativized counterexample to the conjectured connection between the existence of one-way functions and the existence of non-isomorphic NP-complete sets. 2. establishes that in...
One-Way Functions, Robustness, and the Non-Isomorphism of NP-Complete Sets (1986)
Hartmanis, Juris, Hemachandra, Lane A.
This paper 1. gives a relativized counterexample to the conjectured connection between the existence of one-way functions and the existence of non-isomorphic NP-complete sets. 2. establishes that in...
On Sparse Oracles Separating Feasible Complexity Classes (1985)
Hartmanis, Juris, Hemachandra, Lane A.
This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to...
On Sparse Oracles Separating Feasible Complexity Classes (1985)
Hartmanis, Juris, Hemachandra, Lane A.
This note clarifies which oracles separate NP from P and which do not. In essence, we are changing our research paradigm from the study of which problems can be relativized in two conflicting ways to...
On Complete Problems for NP$\cap$CoNP (1985)
Hartmanis, Juris, Immerman, Neil
It is not known whether complete languages exist for $NP\cap CoNP$, and Sipser has shown that there are relativizations so that $NP\cap CoNP$ has no $\leq ^{P}_{m}$-complete languages. In this paper...
On Complete Problems for NP$\cap$CoNP (1985)
Hartmanis, Juris, Immerman, Neil
It is not known whether complete languages exist for $NP\cap CoNP$, and Sipser has shown that there are relativizations so that $NP\cap CoNP$ has no $\leq ^{P}_{m}$-complete languages. In this paper...
Independence Results about Context-Free Languages and Lower Bounds (1984)
We show that for any axiomatizable, sound formal system F there exist instances of natural problems about context-free languages, lower bounds of computations and P versus NP that are not provable in...
Independence Results about Context-Free Languages and Lower Bounds (1984)
We show that for any axiomatizable, sound formal system F there exist instances of natural problems about context-free languages, lower bounds of computations and P versus NP that are not provable in...
On Non-Isomorphic NP Complete Sets (1983)
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity can be determined in polynomial-time then there exist NP complete sets that are not polynomial-time...
On Non-Isomorphic NP Complete Sets (1983)
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity can be determined in polynomial-time then there exist NP complete sets that are not polynomial-time...
Generalized Kolmogorov Complexity and the Structure of Feasible Computations (1983)
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which measures how much and how fast a string can be compressed and we show that this string complexity...
Generalized Kolmogorov Complexity and the Structure of Feasible Computations (1983)
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which measures how much and how fast a string can be compressed and we show that this string complexity...
Computation Times of NP Sets of Different Densities (1983)
Hartmanis, Juris, Yesha, Yaacov
In this paper, we study the computational complexity of sets of different densities in NP. We show that the deterministic computation time for sets in NP can depend on their density if and only if...
Computation Times of NP Sets of Different Densities (1983)
Hartmanis, Juris, Yesha, Yaacov
In this paper, we study the computational complexity of sets of different densities in NP. We show that the deterministic computation time for sets in NP can depend on their density if and only if...
Sparse Sets in NP-P: EXPTIME Versus NEXPTIME (1983)
Hartmanis, Juris, Sewelson, Vivian, Immerman, Neil
This paper investigates the structural properties of sets in NP-P and shows that the computational difficulty of lower density sets in NP depends explicitly on the relations between higher...
Sparse Sets in NP-P: EXPTIME Versus NEXPTIME (1983)
Hartmanis, Juris, Sewelson, Vivian, Immerman, Neil
This paper investigates the structural properties of sets in NP-P and shows that the computational difficulty of lower density sets in NP depends explicitly on the relations between higher...
The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and only if NEXPTIME differs from EXPTIME. Several other results are derived about the complexity of...
The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and only if NEXPTIME differs from EXPTIME. Several other results are derived about the complexity of...
On the Structure of Feasible Computations (1982)
This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to...
On Goedel Speed-Up and Succinctness of Language Representation (1982)
In this note we discuss the similarities and differences between Goedel's result about non-recursive shortening of proofs of formal systems by additional axioms and the corresponding results about...
On the Structure of Feasible Computations (1982)
This paper discusses the study of computational complexity of feasible computations and surveys some recent insights and results about the structure of NP complete languages and the attempts to...
On Goedel Speed-Up and Succinctness of Language Representation (1982)
In this note we discuss the similarities and differences between Goedel's result about non-recursive shortening of proofs of formal systems by additional axioms and the corresponding results about...
An Essay About Research on Sparse NP Complete Sets (1980)
Hartmanis, Juris, Mahaney, Stephen R.
The purpose of this paper is to review the origins and motivation for the conjecture that sparse NP complete sets do not exist (unless P=NP) and to describe the development of the ideas and...
An Essay About Research on Sparse NP Complete Sets (1980)
Hartmanis, Juris, Mahaney, Stephen R.
The purpose of this paper is to review the origins and motivation for the conjecture that sparse NP complete sets do not exist (unless P=NP) and to describe the development of the ideas and...
On Census Complexity and Sparseness of NP Complete Sets (1980)
Hartmanis, Juris, Mahaney, Stephen R.
In this note we show that if there are sparse NP complete sets with a polynomial time computable census function then $P=NP$. We also derive related results about the complexity of the census...
On Census Complexity and Sparseness of NP Complete Sets (1980)
Hartmanis, Juris, Mahaney, Stephen R.
In this note we show that if there are sparse NP complete sets with a polynomial time computable census function then $P=NP$. We also derive related results about the complexity of the census...
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata (1980)
Hartmanis, Juris, Mahaney, Stephen R.
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan their input only once and relate their computational power to two-way, $\log n$-tape automata. We show...
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata (1980)
Hartmanis, Juris, Mahaney, Stephen R.
In this paper we study languages accepted by nondeterministic $\log n$-tape automata which scan their input only once and relate their computational power to two-way, $\log n$-tape automata. We show...
Observations About the Development of Theoretical Computer Science (1980)
This paper gives a personal account of some developments in automata theory and computational complexity theory. Though the account is subjective and deals primarily with the research areas of direct...
A Note on Natural Creative Sets and Goedel Numberings (1980)
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mathematics and they are known to be recursively isomorphic. Therefore, on the one hand, all the...
Observations About the Development of Theoretical Computer Science (1980)
This paper gives a personal account of some developments in automata theory and computational complexity theory. Though the account is subjective and deals primarily with the research areas of direct...
A Note on Natural Creative Sets and Goedel Numberings (1980)
Creative sets (or the complete recursively enumerable sets) play an important role in logic and mathematics and they are known to be recursively isomorphic. Therefore, on the one hand, all the...
Relative Succinctness of Representations of Languages and Separation of Complexity Classes (1978)
In this paper we study the relative succinctness of different representations of polymomial time languages and investigate what can and cannot be formally verified about these representations. We...
Relative Succinctness of Representations of Languages and Separation of Complexity Classes (1978)
In this paper we study the relative succinctness of different representations of polymomial time languages and investigate what can and cannot be formally verified about these representations. We...
One-Way Log-Tape Reductions (1978)
Hartmanis, Juris, Immerman, Neil, Mahaney, Stephen R.
One-way log-tape (1-L) reductions are mappings defined by log-tape Turing machines whose read head on the input can only move to the right. The 1-L reductions provide a more refined tool for studying...
One-Way Log-Tape Reductions (1978)
Hartmanis, Juris, Immerman, Neil, Mahaney, Stephen R.
One-way log-tape (1-L) reductions are mappings defined by log-tape Turing machines whose read head on the input can only move to the right. The 1-L reductions provide a more refined tool for studying...
On the Succintness of Different Representations of Languages (1978)
The purpose of this paper is to give simple new proofs of some interesting recent results about the relative succintness of different representations of regular, deterministic and unambiguous...
On the Succintness of Different Representations of Languages (1978)
The purpose of this paper is to give simple new proofs of some interesting recent results about the relative succintness of different representations of regular, deterministic and unambiguous...
Conway, and Gerry Salton, on the occasion of Juris Hartmanis’s Turing Award celebration. (1978)
Juris Hartmanis, Juris Hartmanis, David Gries, John Hopcroft, Juris Hartmanis, Bob Constable, ...
Degrees granted 25 20 15 10 5 PhD’s Granted
On Log-Tape Isomorphisms of Complete Sets (1977)
In this paper we study $\log n$-tape computable reductions between sets and investigate conditions under which $\log n$-tape reductions between sets can be extended to $\log n$-tape computable...
On Log-Tape Isomorphisms of Complete Sets (1977)
In this paper we study $\log n$-tape computable reductions between sets and investigate conditions under which $\log n$-tape reductions between sets can be extended to $\log n$-tape computable...
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (1977)
In this paper we study diagonal processes over time-bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal proofs that they operate in...
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (1977)
In this paper we study diagonal processes over time-bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal proofs that they operate in...
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (1977)
In this paper we study diagonal processes over time-bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal proofs that they operate in...
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (1977)
In this paper we study diagonal processes over time-bounded computations of one-tape Turing machines by diagonalizing only over those machines for which there exist formal proofs that they operate in...
Independence Results in Computer Science (1976)
Hartmanis, Juris, Hopcroft, John E.
In this note we show that instances of problems which appear naturally in computer science cannot be answered in formalized set theory. We show, for example, that some relativized versions of the...
On Polynomial Time Isomorphism of Complete Sets (1976)
IN this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory and EXPTAPE complete sets arising from algebraic word...
Independence Results in Computer Science (1976)
Hartmanis, Juris, Hopcroft, John E.
In this note we show that instances of problems which appear naturally in computer science cannot be answered in formalized set theory. We show, for example, that some relativized versions of the...
On Polynomial Time Isomorphism of Complete Sets (1976)
IN this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory and EXPTAPE complete sets arising from algebraic word...
On Isomorphisms and Density of NP and Other Complete Sets (1975)
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P $\neq$ NP and if all PTAPE complete sets are p-isomorphic then P $\neq$ PTAPE. We show that...
On Isomorphisms and Density of NP and Other Complete Sets (1975)
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P $\neq$ NP and if all PTAPE complete sets are p-isomorphic then P $\neq$ PTAPE. We show that...
On Effective Speed-up and Long Proofs of Trivial Theorems in Formal Theories (1975)
In this note we give a very simple proof which shows that in many interesting formal mathematical theories, axiomatizable as well as decidable ones, for every given formalization we can effectively...
On Effective Speed-up and Long Proofs of Trivial Theorems in Formal Theories (1975)
In this note we give a very simple proof which shows that in many interesting formal mathematical theories, axiomatizable as well as decidable ones, for every given formalization we can effectively...
A Note on Tape Bounds for SLA Language Processing (1975)
In this note we show that the tape bounded complexity classes of languages over single letter alphabets are closed under complementation. We then use this result to show that there exists an infinite...
A Note on Tape Bounds for SLA Language Processing (1975)
In this note we show that the tape bounded complexity classes of languages over single letter alphabets are closed under complementation. We then use this result to show that there exists an infinite...
On the Power of Multiplication in Random Access Machines (1974)
Hartmanis, Juris, Simon, Janos
We consider random access machines with a multiplication operation, having the added capability of computing logical operations on bit vectors in parallel. The contents of a register are considered...
On the Power of Multiplication in Random Access Machines (1974)
Hartmanis, Juris, Simon, Janos
We consider random access machines with a multiplication operation, having the added capability of computing logical operations on bit vectors in parallel. The contents of a register are considered...
On the Structure of Feasible Computations (1974)
Hartmanis, Juris, Simon, Janos
During the last four years research on the lower level computational complexity has yielded a rich set of interesting results which have revealed deep and unexpected connections between various...
On the Structure of Feasible Computations (1974)
Hartmanis, Juris, Simon, Janos
During the last four years research on the lower level computational complexity has yielded a rich set of interesting results which have revealed deep and unexpected connections between various...
Computational Complexity of Formal Translations (1973)
The purpose of this paper is to define a mathematical model for the study of quantitative problems about translations between universal languages and to investigate such problems. The results derived...
Computational Complexity of Formal Translations (1973)
The purpose of this paper is to define a mathematical model for the study of quantitative problems about translations between universal languages and to investigate such problems. The results derived...
On Simple Goedel Numberings and Translations (1973)
Hartmanis, Juris, Baker, Theodore Paul
In this paper we consider Goedel numberings (viewed as simple models for programming languages) into which all other Goedel numberings can be translated very easily. Several such classes of Goedel...
On Simple Goedel Numberings and Translations (1973)
Hartmanis, Juris, Baker, Theodore Paul
In this paper we consider Goedel numberings (viewed as simple models for programming languages) into which all other Goedel numberings can be translated very easily. Several such classes of Goedel...
On the Problem of Finding Natural Computational Complexity Measures (1973)
To develop an abstract theory which deals with the quantitative aspects of computing we need a deeper understanding of how to define "natural" computational complexity measures axiomatically. To this...
On the Problem of Finding Natural Computational Complexity Measures (1973)
To develop an abstract theory which deals with the quantitative aspects of computing we need a deeper understanding of how to define "natural" computational complexity measures axiomatically. To this...
The LBA Problem and its Importance in the Theory of Computing (1973)
In this paper we study the classic problem of determining whether the deterministic and non-deterministic context-sensitive languages are the same or, equivalently, whether the languages accepted by...
The LBA Problem and its Importance in the Theory of Computing (1973)
In this paper we study the classic problem of determining whether the deterministic and non-deterministic context-sensitive languages are the same or, equivalently, whether the languages accepted by...
Final Report on NSF Research Grant Automata and Computational Complexity 1968-1972 (1972)
Hartmanis, Juris (Principal Investigator)
This report summarizes the results obtained in research supported by the National Science Foundation Grant AUTOMATA AND COMPUTATIONAL COMPLEXITY. The report lists the problem areas considered, the...
Final Report on NSF Research Grant Automata and Computational Complexity 1968-1972 (1972)
Hartmanis, Juris (Principal Investigator)
This report summarizes the results obtained in research supported by the National Science Foundation Grant AUTOMATA AND COMPUTATIONAL COMPLEXITY. The report lists the problem areas considered, the...
Computational Complexity of Random Access Stored Program Machines (1970)
In this paper we explore the computational complexity measure defined by running times of programs on random access stored program machines, RASP'S. The purpose of this work is to study more...
Size Arguments in the Study of Computation Speeds (1970)
In this paper we use arguments about the size of the computed functions to investigate the computation speed of Turing machines. It turns out that the size arguments yield several new results which...
Computational Complexity of Random Access Stored Program Machines (1970)
In this paper we explore the computational complexity measure defined by running times of programs on random access stored program machines, RASP'S. The purpose of this work is to study more...
Size Arguments in the Study of Computation Speeds (1970)
In this paper we use arguments about the size of the computed functions to investigate the computation speed of Turing machines. It turns out that the size arguments yield several new results which...
An Overview of the Theory of Computational Complexity (1970)
Hartmanis, Juris, Hopcroft, John E.
The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative...
An Overview of the Theory of Computational Complexity (1970)
Hartmanis, Juris, Hopcroft, John E.
The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative...
The Use of Lists in the Study of Undecidable Problems in Automata Theory (1970)
Hartmanis, Juris, Lewis, Forbes
NO ABSTRACT SUPPLIED
The Use of Lists in the Study of Undecidable Problems in Automata Theory (1970)
Hartmanis, Juris, Lewis, Forbes
NO ABSTRACT SUPPLIED
A Note on One-way and Two-way Automata (1969)
The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this...
A Note on One-way and Two-way Automata (1969)
The purpose of this note is to show that there exist non-regular languages whose memory requirements for recognition by one-way and two-way automata differ by a double exponential and that this...
Refinement of Hierarchies of Time Bounded Computations (1968)
Hartmanis, Juris, Hopcroft, John E.
It is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$...
Two Memory Bounds for the Recognition of Primes by Automata (1968)
Two Memory Bounds for the Recognition of Primes by Automata
Refinement of Hierarchies of Time Bounded Computations (1968)
Hartmanis, Juris, Hopcroft, John E.
It is shown that for any "slowly growing" time function $T(n)$ and any $\epsilon > 0$ there exists a computation which can be performed by a multitape Turing machine in time $T(n)\log^{\epsilon}T(n)$...
Two Memory Bounds for the Recognition of Primes by Automata (1968)
Two Memory Bounds for the Recognition of Primes by Automata
On the Recognition of Primes by Automata (1968)
A study of the problem of recognizing the set of primes by automata is presented. A simple algebraic condition is derived which shows that neither the set of primes nor any infinite subset of primes...
Tape Reversal Bounded Turing Machine Computations (1968)
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a...
On the Recognition of Primes by Automata (1968)
A study of the problem of recognizing the set of primes by automata is presented. A simple algebraic condition is derived which shows that neither the set of primes nor any infinite subset of primes...
Tape Reversal Bounded Turing Machine Computations (1968)
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a...
Computational Complexity of One-Tape Turing Machine Computations (1968)
This paper is concerned with the quantitative aspects of one-tape Turing machine computations. It is shown, for instance, that there exists a sharp time bound which must be reached for the...
Computational Complexity of One-Tape Turing Machine Computations (1968)
This paper is concerned with the quantitative aspects of one-tape Turing machine computations. It is shown, for instance, that there exists a sharp time bound which must be reached for the...
Some embedding theorems for lattices (1955)
In this thesis we give a general definition of a geometry on a set S and consider the lattices of the subspaces of these geometries. First, we show that all such geometries on a fixed set S form a...