中国机械工程学会生产工程分会知识服务平台

期刊


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

2006, vol.350, no.1 2006, vol.350, no.2-3 2006, vol.351, no.1 2006, vol.351, no.2 2006, vol.351, no.3 2006, vol.352, no.1-3
2006, vol.353, no.1-3 2006, vol.354, no.1 2006, vol.354, no.2 2006, vol.354, no.3 2006, vol.355, no.1 2006, vol.355, no.2
2006, vol.355, no.3 2006, vol.356, no.1-2 2006, vol.356, no.3 2006, vol.357, no.1-3 2006, vol.358, no.1 2006, vol.358, no.2-3
2006, vol.359, no.1-3 2006, vol.360, no.1-3 2006, vol.361, no.1 2006, vol.361, no.2-3 2006, vol.362, no.1-3 2006, vol.363, no.1
2006, vol.363, no.2 2006, vol.363, no.3 2006, vol.364, no.1 2006, vol.364, no.2 2006, vol.364, no.3 2006, vol.365, no.1-2
2006, vol.365, no.3 2006, vol.366, no.1-2 2006, vol.366, no.3 2006, vol.367, no.1-2 2006, vol.367, no.3 2006, vol.368, no.1-2
2006, vol.368, no.3 2006, vol.369, no.1-3

题名作者出版年年卷期
Justified common knowledgeSergei Artemov20062006, vol.357, no.1-3
Making knowledge explicit: How hard it isVladimir Brezhnev; Roman Kuznets20062006, vol.357, no.1-3
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologiesSamuel R. Buss20062006, vol.357, no.1-3
Abstract canonical presentationsNachum Dershowitz; Claude Kirchner20062006, vol.357, no.1-3
Combining effects: Sum and tensorMartin Hyland; Gordon Plotkin; John Power20062006, vol.357, no.1-3
From truth to computabilityGiorgi Japaridze20062006, vol.357, no.1-3
On the complexity of the reflected logic of proofsNikolai V. Krupski20062006, vol.357, no.1-3
Referential logic of proofsVladimir N. Krupski20062006, vol.357, no.1-3
Logic of subtypingPavel Naumov20062006, vol.357, no.1-3
Lambek calculus is NP-completeMati Pentus20062006, vol.357, no.1-3
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  京公网安备11010202008970号  机械工业信息研究院 2018-2024