主页
外文期刊
OA 期刊
电子期刊
外文会议
中文期刊
标准
网络数据库
专业机构
企业门户
起重机械
生产工程
高级检索
关于我们
版权声明
使用帮助
期刊
ISSN
0304-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 classes
Sebastian Bab; Arfst Nickelsen
2005
2005, vol.345, no.2-3
A hierarchy of shift equivalent sofic shifts
Marie-Pierre Beal; Francesca Fiorenzi; Dominique Perrin
2005
2005, vol.345, no.2-3
A common algebraic description for probabilistic and quantum computations
Martin Beaudry; Jose M. Fernandez; Markus Holzer
2005
2005, vol.345, no.2-3
A new dimension sensitive property for cellular automata
Vincent Bernardi; Bruno Durand; Enrico Formenti; Jarkko Kari
2005
2005, vol.345, no.2-3
The enumerability of P collapses P to NC
Alina Beygelzimer; Mitsunori Ogihara
2005
2005, vol.345, no.2-3
Generation problems
E. Bohler; C. GlaBer; B. Schwarz; K. W. Wagner
2005
2005, vol.345, no.2-3
The non-parametrizability of the word equation xyz = zvx: A short proof
Elena Czeizler
2005
2005, vol.345, no.2-3
Decidability of trajectory-based equations
Michael Domaratzki; Kai Salomaa
2005
2005, vol.345, no.2-3
Graph exploration by a finite automaton
Pierre Fraigniaud; David Ilcinkas; Guy Peer; Andrzej Pelc; David Peleg
2005
2005, vol.345, no.2-3
All superlinear inverse schemes are coNP-hard
Edith Hemaspaandra; Lane A. Hemaspaandra; Harald Hempel
2005
2005, vol.345, no.2-3
1
2
国家科技图书文献中心
全球文献资源网
京ICP备05055788号-26
机械工业信息研究院 2018-2024