期刊


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

2023, vol.939 2023, vol.940, no.Pt.A 2023, vol.940, no.Pt.B 2023, vol.941 2023, vol.942 2023, vol.943
2023, vol.944 2023, vol.945 2023, vol.946 2023, vol.947 2023, vol.948 2023, vol.949
2023, vol.950 2023, vol.951 2023, vol.952 2023, vol.953 2023, vol.954 2023, vol.955
2023, vol.956 2023, vol.957 2023, vol.958 2023, vol.959 2023, vol.960 2023, vol.961
2023, vol.962 2023, vol.963 2023, vol.964 2023, vol.965 2023, vol.966/967 2023, vol.968
2023, vol.969 2023, vol.970 2023, vol.971 2023, vol.972 2023, vol.973 2023, vol.974
2023, vol.975 2023, vol.976 2023, vol.977 2023, vol.978 2023, vol.979 2023, vol.980

题名作者出版年年卷期
Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation costZhang L.; Zhang Y.; Yu J.; Du D.; Guo M.20232023, vol.949
Ordering regular languages and automata: ComplexityD'Agostino G.; Martincigh D.; Policriti A.20232023, vol.949
Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problemsLaber E.S.; Saadi Murtinho L.20232023, vol.949
Taming randomness and complexity – Essays in honour of Professor Péter GácsCapuni I.; Kari J.; Shen A.20232023, vol.949
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity propertiesBang-Jensen J.; Yeo A.20232023, vol.949
Relativized depthBienvenu L.; Delle Rose V.; Merkle W.20232023, vol.949
A proof system for unified temporal logicZhang N.; Yu C.; Duan Z.; Tian C.20232023, vol.949
Dichotomy result on 3-regular bipartite non-negative functionsFan A.Z.; Cai J.-Y.20232023, vol.949



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