期刊


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

题名作者出版年年卷期
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SATAmin Coja-Oghlan; Andreas Goerdt; Andre Lanka; Frank Schadlich20042004, vol.329, no.1-3
On Robson's convergence and boundedness conjectures concerning the height of binary search treesMichael Drmota20042004, vol.329, no.1-3
ω-Regular languages are testable with a constant number of queriesHana Chockler; Orna Kupferman20042004, vol.329, no.1-3
Recognizing frozen variables in constraint satisfaction problemsPeter Jonsson; Andrei Krokhin20042004, vol.329, no.1-3
Storage-to-tree transducers with look-aheadTamas Hornung; Sandor Vagvolgyi20042004, vol.329, no.1-3
A proof-theoretic characterization of the basic feasible functionalThomas Strahm20042004, vol.329, no.1-3
Codes, orderings, and partial wordsF. Blanchet-Sadri20042004, vol.329, no.1-3
Polynomial time learning of simple deterministic languages via queries and a representative sampleYasuhiro Tajima; Etsuji Tomita; Mitsuo Wakatsuki; Matsuaki Terada20042004, vol.329, no.1-3
On the complexities of multipoint evaluation and interpolationAlin Bostan; Eric Schost20042004, vol.329, no.1-3
Some minimum merging networksGembu Morohashi; Shigeki Iwata20042004, vol.329, no.1-3
12