期刊


ISSN0304-3975
刊名Theoretical Computer Science
参考译名理论计算机科学
收藏年代2002～2024



全部

2002 2003 2004 2005 2006 2007
2008 2009 2010 2011 2012 2013
2014 2015 2016 2017 2018 2019
2020 2021 2022 2023 2024

2004, vol.310, no.1-3 2004, vol.311, no.1-3 2004, vol.312, no.1 2004, vol.312, no.2-3 2004, vol.313, no.1 2004, vol.313, no.2
2004, vol.313, no.3 2004, vol.314, no.1-2 2004, vol.314, no.3 2004, vol.315, no.1 2004, vol.315, no.2-3 2004, vol.316, no.1-3
2004, vol.317, no.1-3 2004, vol.318, no.1-2 2004, vol.318, no.3 2004, vol.319, no.1-3 2004, vol.320, no.1 2004, vol.320, no.2-3
2004, vol.321, no.1 2004, vol.321, no.2-3 2004, vol.322, no.1 2004, vol.322, no.2 2004, vol.322, no.3 2004, vol.323, no.1-3
2004, vol.324, no.1 2004, vol.324, no.2-3 2004, vol.325, no.1 2004, vol.325, no.2 2004, vol.325, no.3 2004, vol.326, no.1-3
2004, vol.327, no.1-2 2004, vol.327, no.3 2004, vol.328, no.1-2 2004, vol.328, no.3 2004, vol.329, no.1-3

题名作者出版年年卷期
On the computational complexity of Longley's H functionalJames S. Royer20042004, vol.318, no.1-2
Minimization and NP multifunctionsN. Danner; C. Pollett20042004, vol.318, no.1-2
Intrinsic reasoning about functional programs - II: unipolar induction and primitive-recursionDaniel Leivant20042004, vol.318, no.1-2
Automated higher-order complexity analysisRalph Benzinger20042004, vol.318, no.1-2
Soft linear logic and polynomial timeYves Lafont20042004, vol.318, no.1-2
On an interpretation of safe recursion in light affine logicA. S. Murawski; C. -H. L. Ong20042004, vol.318, no.1-2
On the computational complexity of imperative programming languagesL. Kristiansen; K. -H. Niggl20042004, vol.318, no.1-2
Realizability models for BLL-like languagesM. Hofmann; P. J. Scott20042004, vol.318, no.1-2
An arithmetic for non-size-increasing polynomial-time computationKlaus Aehlig; Ulrich Berger; Martin Hofmann; Helmut Schwichtenberg20042004, vol.318, no.1-2
Separating NC along the δ axisS. Bellantoni; I. Oitavem20042004, vol.318, no.1-2
12



制造业外文文献服务平台