Marion, J.-Y. (ed.) Special issue: Implicit computational complexity. Selected papers based on the presentation at the workshop, Santa Barbara, CA, USA, June 29–30, 2000. (English) Zbl 1093.68516 Theor. Comput. Sci. 318, No. 1-2, 241 p. (2004). MSC: 68-06 00B25 PDF BibTeX XML Cite \textit{J. Y. Marion} (ed.), Theor. Comput. Sci. 318, No. 1--2, 241~p. (2004; Zbl 1093.68516)
Royer, James S. On the computational complexity of Longley’s \(H\) functional. (English) Zbl 1077.68035 Theor. Comput. Sci. 318, No. 1-2, 225-241 (2004). MSC: 68Q17 03D15 PDF BibTeX XML Cite \textit{J. S. Royer}, Theor. Comput. Sci. 318, No. 1--2, 225--241 (2004; Zbl 1077.68035) Full Text: DOI
Murawski, A. S.; Ong, C.-H. L. On an interpretation of safe recursion in light affine logic. (English) Zbl 1048.03049 Theor. Comput. Sci. 318, No. 1-2, 197-223 (2004). MSC: 03F52 03D15 03D20 68Q15 68Q17 PDF BibTeX XML Cite \textit{A. S. Murawski} and \textit{C. H. L. Ong}, Theor. Comput. Sci. 318, No. 1--2, 197--223 (2004; Zbl 1048.03049) Full Text: DOI
Leivant, Daniel Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion. (English) Zbl 1046.03015 Theor. Comput. Sci. 318, No. 1-2, 181-196 (2004). MSC: 03B70 68N18 03D20 PDF BibTeX XML Cite \textit{D. Leivant}, Theor. Comput. Sci. 318, No. 1--2, 181--196 (2004; Zbl 1046.03015) Full Text: DOI
Lafont, Yves Soft linear logic and polynomial time. (English) Zbl 1079.03057 Theor. Comput. Sci. 318, No. 1-2, 163-180 (2004). MSC: 03F52 03B40 03D15 68Q15 PDF BibTeX XML Cite \textit{Y. Lafont}, Theor. Comput. Sci. 318, No. 1--2, 163--180 (2004; Zbl 1079.03057) Full Text: DOI
Kristiansen, L.; Niggl, K.-H. On the computational complexity of imperative programming languages. (English) Zbl 1048.03030 Theor. Comput. Sci. 318, No. 1-2, 139-161 (2004). MSC: 03D10 03D15 03D20 68Q15 68N15 PDF BibTeX XML Cite \textit{L. Kristiansen} and \textit{K. H. Niggl}, Theor. Comput. Sci. 318, No. 1--2, 139--161 (2004; Zbl 1048.03030) Full Text: DOI
Hofmann, M.; Scott, P. J. Realizability models for BLL-like languages. (English) Zbl 1047.03049 Theor. Comput. Sci. 318, No. 1-2, 121-137 (2004). MSC: 03F52 03C13 68Q19 68Q15 03F20 03F05 PDF BibTeX XML Cite \textit{M. Hofmann} and \textit{P. J. Scott}, Theor. Comput. Sci. 318, No. 1--2, 121--137 (2004; Zbl 1047.03049) Full Text: DOI
Danner, N.; Pollett, C. Minimization and \(\mathbf{NP}\) multifunctions. (English) Zbl 1081.03041 Theor. Comput. Sci. 318, No. 1-2, 105-119 (2004). MSC: 03D15 03D20 68Q15 PDF BibTeX XML Cite \textit{N. Danner} and \textit{C. Pollett}, Theor. Comput. Sci. 318, No. 1--2, 105--119 (2004; Zbl 1081.03041) Full Text: DOI
Benzinger, Ralph Automated higher-order complexity analysis. (English) Zbl 1071.68029 Theor. Comput. Sci. 318, No. 1-2, 79-103 (2004). MSC: 68Q25 68T15 68N18 PDF BibTeX XML Cite \textit{R. Benzinger}, Theor. Comput. Sci. 318, No. 1--2, 79--103 (2004; Zbl 1071.68029) Full Text: DOI
Bellantoni, S.; Oitavem, I. Separating NC along the \(\delta\) axis. (English) Zbl 1076.68030 Theor. Comput. Sci. 318, No. 1-2, 57-78 (2004). MSC: 68Q15 PDF BibTeX XML Cite \textit{S. Bellantoni} and \textit{I. Oitavem}, Theor. Comput. Sci. 318, No. 1--2, 57--78 (2004; Zbl 1076.68030) Full Text: DOI
Baillot, Patrick Stratified coherence spaces: A denotational semantics for light linear logic. (English) Zbl 1051.03050 Theor. Comput. Sci. 318, No. 1-2, 29-55 (2004). Reviewer: Saeed Salehí (Turku) MSC: 03F52 PDF BibTeX XML Cite \textit{P. Baillot}, Theor. Comput. Sci. 318, No. 1--2, 29--55 (2004; Zbl 1051.03050) Full Text: DOI
Aehlig, Klaus; Berger, Ulrich; Hofmann, Martin; Schwichtenberg, Helmut An arithmetic for non-size-increasing polynomial-time computation. (English) Zbl 1064.03036 Theor. Comput. Sci. 318, No. 1-2, 3-27 (2004). MSC: 03F20 03D15 03B40 PDF BibTeX XML Cite \textit{K. Aehlig} et al., Theor. Comput. Sci. 318, No. 1--2, 3--27 (2004; Zbl 1064.03036) Full Text: DOI