Search Results - Hartmanis, Juris
- Showing 1 – 20 results of 47
- Go to Next Page
-
1Generalized Kolmogorov complexity and the structure of feasible computationsPublished 1983Call Number: Loading…
Located: Loading…Book Loading… -
2Feasible computations and provable complexity propertiesPublished 1978Call Number: Loading…Read online
Located: Loading…Electronic eBook Loading… -
3On log-tape isomorphisms of complete setsPublished 1977Call Number: Loading…
Located: Loading…Book Loading… -
4Independence results in computer sciencePublished 1976Call Number: Loading…
Located: Loading…Book Loading… -
5A note on tape bounds for SLA language processingPublished 1975Call Number: Loading…
Located: Loading…Book Loading… -
6On simple Goedel numberings and translationsPublished 1973Call Number: Loading…
Located: Loading…Book Loading… -
7Complexity of formal translations and speed-up resultsPublished 1970Call Number: Loading…
Located: Loading…Book Loading… -
8On complete problems for NPnCoNPPublished 1985Call Number: Loading…
Located: Loading…Book Loading… -
9On non-isomorphic NP complete setsPublished 1983Call Number: Loading…
Located: Loading…Book Loading… -
10On Goedel speed up and succinctness of language representationPublished 1982Call Number: Loading…
Located: Loading…Book Loading… -
11On sparse sets in NP-PPublished 1982Call Number: Loading…
Located: Loading…Book Loading… -
12Observations about the development of theoretical computer sciencePublished 1979Call Number: Loading…
Located: Loading…Book Loading… -
13On the succinctness of different representations of languagesPublished 1978Call Number: Loading…
Located: Loading…Book Loading… -
14One-way log-tape reductionsPublished 1978Call Number: Loading…
Located: Loading…Book Loading… -
15Relations between diagonalization, proof systems, and complexity gapsPublished 1977Call Number: Loading…
Located: Loading…Book Loading… -
16On polynomial time isomorphisms of complete setsPublished 1976Call Number: Loading…
Located: Loading…Book Loading… -
17On effective speed-up and long proofs of trivial theorems in formal theoriesPublished 1975Call Number: Loading…
Located: Loading…Book Loading… -
18On the structure of feasible computationsPublished 1974Call Number: Loading…
Located: Loading…Book Loading… -
19The LBA problem and its importance in the theory of computingPublished 1973Call Number: Loading…
Located: Loading…Book Loading… -
20On the problem of finding natural computational complexity measuresPublished 1973Call Number: Loading…
Located: Loading…Book Loading…