Логическая сложность свойства наличия индуцированного подграфа, изоморфного данному, для некоторых семейств графов
- 25 March 2021
- journal article
- Published by Steklov Mathematical Institute
- Vol. 212 (4), 76-90
- https://doi.org/10.4213/sm9259
Abstract
No abstract availableFunding Information
- Russian Science Foundation (18-71-00069)
This publication has 11 references indexed in Scilit:
- On first-order definitions of subgraph isomorphism propertiesDoklady Mathematics, 2017
- ЗАПИСЬ СВОЙСТВА СУЩЕСТВОВАНИЯ ИЗОМОРФНОГО ПОДГРАФА НА ЯЗЫКЕ ПЕРВОГО ПОРЯДКАДоклады Академии наук, 2017
- Random graphs: models and asymptotic characteristicsRussian Mathematical Surveys, 2015
- Случайные графы: модели и предельные характеристикиUspekhi Matematicheskikh Nauk, 2015
- Powers of tensors and fast matrix multiplicationPublished by Association for Computing Machinery (ACM) ,2014
- Strong computational lower bounds via parameterized complexityJournal of Computer and System Sciences, 2006
- On the complexity of fixed parameter clique and dominating setTheoretical Computer Science, 2004
- Elements of Finite Model TheoryPublished by Springer Science and Business Media LLC ,2004
- Random GraphsPublished by Wiley ,2000
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960