期刊


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

2019, vol.753 2019, vol.754 2019, vol.755 2019, vol.756 2019, vol.757 2019, vol.758
2019, vol.759 2019, vol.760 2019, vol.761 2019, vol.762 2019, vol.763 2019, vol.764
2019, vol.765 2019, vol.766 2019, vol.767 2019, vol.768 2019, vol.769 2019, vol.770
2019, vol.771 2019, vol.772 2019, vol.773 2019, vol.774 2019, vol.775 2019, vol.776
2019, vol.777 2019, vol.778 2019, vol.779 2019, vol.780 2019, vol.781 2019, vol.782
2019, vol.783 2019, vol.784 2019, vol.785 2019, vol.786 2019, vol.787 2019, vol.788
2019, vol.789 2019, vol.790 2019, vol.791 2019, vol.792 2019, vol.793 2019, vol.794
2019, vol.795 2019, vol.796 2019, vol.797 2019, vol.798 2019, vol.799 2019, vol.800

题名作者出版年年卷期
Min (a)cyclic feedback vertex sets and min ones monotone 3-SATRusu, Irena20192019, vol.771
How many triangles and quadrilaterals are there in an n-dimensional augmented cube?Wang, Xi; Dong, Qiang20192019, vol.771
Alternation, sparsity and sensitivity: Bounds and exponential gapsDinesh, Krishnamoorthy; Sarma, Jayalal20192019, vol.771
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problemRavelo, Santiago Valdes; Ferreira, Carlos Eduardo20192019, vol.771
Deadline TSPFarbstein, Boaz; Levin, Asaf20192019, vol.771
Weighted proper orientations of trees and graphs of bounded treewidthAraujo, Julio; Sales, Claudia Linhares; Sau, Ignasi; Silva, Ana20192019, vol.771
Optimal linear secret sharing schemes for graph access structures on six participantsGharahi, Motahhareh; Khazaei, Shahram20192019, vol.771
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problemAung, Khin Mi Mi; Lee, Hyung Tae; Tan, Benjamin Hong Meng; Wang, Huaxiong20192019, vol.771



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