期刊


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

2024, vol.1000 2024, vol.1001 2024, vol.1002 2024, vol.1003 2024, vol.1004 2024, vol.1005
2024, vol.1006 2024, vol.1007 2024, vol.981 2024, vol.982 2024, vol.983 2024, vol.984
2024, vol.985 2024, vol.986 2024, vol.987 2024, vol.988 2024, vol.989 2024, vol.990
2024, vol.991 2024, vol.992 2024, vol.993 2024, vol.994 2024, vol.995 2024, vol.996
2024, vol.997 2024, vol.998 2024, vol.999

题名作者出版年年卷期
On the computational completeness of generalized forbidding matrix grammarsFernau H.; Kuppusamy L.; Raman I.20242024, vol.999
Corrigendum to “Improved Algorithm for Permutation Testing” [Theoretical Computer Science 986 (2024) 114316] (Theoretical Computer Science (2024) 986, (S0304397523006291), (10.1016/j.tcs.2023.114316))Zhang X.20242024, vol.999
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatamiFazekas S.Z.; Seki S.; Iwano N.; Kihara Y.; Matsuoka R.; Takeuchi H.20242024, vol.999
Partial prime factor exposure attacks on some RSA variantsFeng Y.; Pan Y.; Nitaj A.20242024, vol.999
Hardness of Entropic Module-LWELin H.; Wang M.; Wang Y.; Zhuang J.20242024, vol.999
Optimal deterministic quantum algorithm for the promised element distinctness problemLi G.; Li L.20242024, vol.999
Decomposition and factorisation of transients in functional graphsDore F.; Formenti E.; Riva S.; Porreca A.E.20242024, vol.999
Complexity of a root clustering algorithm for holomorphic functionsBatra P.; Sharma V.20242024, vol.999



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