期刊


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

2005, vol.330, no.1 2005, vol.330, no.2 2005, vol.330, no.3 2005, vol.331, no.1 2005, vol.331, no.2-3 2005, vol.332, no.1-3
2005, vol.333, no.1-2 2005, vol.333, no.3 2005, vol.334, no.1-3 2005, vol.335, no.1 2005, vol.335, no.2-3 2005, vol.336, no.1
2005, vol.336, no.2-3 2005, vol.337, no.1-3 2005, vol.338, no.1-3 2005, vol.339, no.1 2005, vol.339, no.2-3 2005, vol.340, no.1
2005, vol.340, no.2 2005, vol.340, no.3 2005, vol.341, no.1-3 2005, vol.342, no.1 2005, vol.342, no.2-3 2005, vol.343, no.1-2
2005, vol.343, no.3 2005, vol.344, no.1 2005, vol.344, no.2-3 2005, vol.345, no.1 2005, vol.345, no.2-3 2005, vol.346, no.1
2005, vol.346, no.2-3 2005, vol.347, no.1-2 2005, vol.347, no.3 2005, vol.348, no.1 2005, vol.348, no.2-3 2005, vol.349, no.1
2005, vol.349, no.2 2005, vol.349, no.3

题名作者出版年年卷期
One query reducibilities between partial information classesSebastian Bab; Arfst Nickelsen20052005, vol.345, no.2-3
A hierarchy of shift equivalent sofic shiftsMarie-Pierre Beal; Francesca Fiorenzi; Dominique Perrin20052005, vol.345, no.2-3
A common algebraic description for probabilistic and quantum computationsMartin Beaudry; Jose M. Fernandez; Markus Holzer20052005, vol.345, no.2-3
A new dimension sensitive property for cellular automataVincent Bernardi; Bruno Durand; Enrico Formenti; Jarkko Kari20052005, vol.345, no.2-3
The enumerability of P collapses P to NCAlina Beygelzimer; Mitsunori Ogihara20052005, vol.345, no.2-3
Generation problemsE. Bohler; C. GlaBer; B. Schwarz; K. W. Wagner20052005, vol.345, no.2-3
The non-parametrizability of the word equation xyz = zvx: A short proofElena Czeizler20052005, vol.345, no.2-3
Decidability of trajectory-based equationsMichael Domaratzki; Kai Salomaa20052005, vol.345, no.2-3
Graph exploration by a finite automatonPierre Fraigniaud; David Ilcinkas; Guy Peer; Andrzej Pelc; David Peleg20052005, vol.345, no.2-3
All superlinear inverse schemes are coNP-hardEdith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel20052005, vol.345, no.2-3
12



制造业外文文献服务平台