The following pages link to Juris Hartmanis (Q1071499):
Displaying 50 items.
- (Q594583) (redirect page) (← links)
- On Goedel speed-up and succinctness of language representations (Q594584) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- Robust machines accept easy sets (Q914369) (← links)
- Independence results about context-free languages and lower bounds (Q1071500) (← links)
- Complexity classes without machines: on complete languages for UP (Q1109566) (← links)
- On sparse oracles separating feasible complexity classes (Q1111385) (← links)
- A note on natural complete sets and Goedel numberings (Q1163015) (← links)
- On sparse sets in NP-P (Q1172386) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- On log-tape isomorphisms of complete sets (Q1249940) (← links)
- Relations between diagonalization, proof systems, and complexity gaps (Q1254105) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line (Q1342862) (← links)
- Computation times of NP sets of different densities (Q1348523) (← links)
- Homomorphic images of linear sequential machines (Q2532398) (← links)
- What makes some language theory problems undecidable (Q2540268) (← links)
- On non-determinacy in simple computing devices (Q2550291) (← links)
- The use of lists in the study of undecidable problems in automata theory (Q2551463) (← links)
- Tape-reversal bounded Turing machine computations (Q2560051) (← links)
- One-way functions and the nonisomorphism of NP-complete sets (Q2639055) (← links)
- (Q2776606) (← links)
- Turing Machine-Inspired Computer Science Results (Q2904417) (← links)
- Two Embedding Theorems for Finite Lattices (Q3239703) (← links)
- On the Lattice of Topologies (Q3260149) (← links)
- A Note on the Lattice of Geometries (Q3264605) (← links)
- Lattice Theory of Generalized Partitions (Q3264606) (← links)
- The application of some basic inequalities for entropy (Q3274426) (← links)
- Loop-free structure of sequential machines (Q3280462) (← links)
- Some dangers in state reduction of sequential machines (Q3290922) (← links)
- (Q3315500) (← links)
- Separation of complexity classes (Q3455554) (← links)
- On the computing paradigm and computational complexity (Q3569001) (← links)
- (Q3696516) (← links)
- Sparse sets in NP-P: EXPTIME versus NEXPTIME (Q3711749) (← links)
- (Q3742716) (← links)
- (Q3783559) (← links)
- (Q3795226) (← links)
- (Q3801071) (← links)
- (Q3802608) (← links)
- (Q3811710) (← links)
- (Q3811711) (← links)
- (Q3823798) (← links)
- (Q3830532) (← links)
- The Boolean Hierarchy I: Structural Properties (Q3832042) (← links)
- The Boolean Hierarchy II: Applications (Q3832043) (← links)
- Regularity preserving modifications of regular expressions (Q3849398) (← links)
- (Q3888527) (← links)
- On the Succinctness of Different Representations of Languages (Q3901021) (← links)
- Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata (Q3926063) (← links)
