期刊


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

题名作者出版年年卷期
Lower bounds and the hardness of counting propertiesLane A. Hemaspaandra; Mayur Thakur20042004, vol.326, no.1-3
On maximal instances for the original syntenic distanceCedric Chauve; Guillaume Fertin20042004, vol.326, no.1-3
Small Turing machines and generalized busy beaver competitionPascal Michel20042004, vol.326, no.1-3
On the complexity of fixed parameter clique and dominating setFriedrich Eisenbrand; Fabrizio Grandoni20042004, vol.326, no.1-3
Limiting distributions for additive functionals on Catalan treesJames Allen Fill; Nevin Kapur20042004, vol.326, no.1-3
Characterization of networks supporting multi-dimensional linear interval routing schemesYashar Ganjali; Mohammad Taghi Hajiaghayi20042004, vol.326, no.1-3
Random generation of 2×2×...×2×J contingency tablesTomomi Matsui; Yasuko Matsui; Yoko Ono20042004, vol.326, no.1-3
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequalityHans-Joachim Bockenhauer; Dirk Bongartz; Juraj Hromkovic; Ralf Klasing; Guido Proietti; Sebastian Seibert; Walter Unger20042004, vol.326, no.1-3
Complexity of pairwise shortest path routing in the gridTeofilo F. Gonzalez; David Serena20042004, vol.326, no.1-3
Computability in linear algebraMartin Ziegler; Vasco Brattka20042004, vol.326, no.1-3
123



制造业外文文献服务平台