Moritz Lichter
Skip Abstract Section
Abstract
In the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends fixed-point logic with counting by a rank operator over prime fields. We show that the isomorphism problem for CFI graphs over ℤ2i cannot be defined in rank logic, even if the base graph is totally ordered. However, CPT can define this isomorphism problem. We thereby separate rank logic from CPT and in particular from polynomial time.
- [1] . 2009. Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410, 18 (2009), 1666–1683.
DOI: Google Scholar
Digital Library
- [2] . 2012. A new bound for the connectivity of cages. Appl. Math. Lett. 25, 11 (2012), 1676–1680.
DOI: Google ScholarCross Ref
- [3] . 2017. Linear diophantine equations, group CSPs, and graph isomorphism. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, (Ed.). SIAM, 327–339.
DOI: Google ScholarCross Ref - [4] . 1967. On the theory of group codes. Kibernetika 3, 1 (1967), 31–39.
DOI: Google ScholarCross Ref - [5] . 1999. Choiceless polynomial time. Ann. Pure Appl. Logic 100, 1-3 (1999), 141–187.
DOI: Google ScholarCross Ref - [6] . 1992. An optimal lower bound on the number of variables for graph identification. Combinatorica 12, 4 (1992), 389–410.
DOI: Google ScholarCross Ref - [7] . 1994. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press. Google Scholar
- [8] . 1982. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 1 (1982), 99–128.
DOI: Google ScholarCross Ref - [9] . 2013. Definability of linear equation systems over groups and rings. Log. Methods Comput. Sci. 9, 4 (2013).
DOI: Google ScholarCross Ref - [10] . 2019. Approximations of isomorphism and logics with linear-algebraic operators. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019.112:1–112:14.
DOI: Google ScholarCross Ref - [11] . 2009. Logics with rank operators. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. IEEE Computer Society, 113–122.
DOI: Google ScholarDigital Library - [12] . 2022. Limitations of the invertible-map equivalences. Journal of Logic and Computation (
09 2022).DOI: Google ScholarCross Ref - [13] . 2012. Pebble games with algebraic rules. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II (Lecture Notes in Computer Science), , , , and (Eds.), Vol. 7392. Springer, 251–262.
DOI: Google ScholarDigital Library - [14] . 2008. Choiceless polynomial time, counting and the Cai-Fürer-immerman graphs. Ann. Pure Appl. Logic 152, 1-3 (2008), 31–50.
DOI: Google ScholarCross Ref - [15] . 2001. Weisfeiler-lehman refinement requires at least a linear number of iterations. In Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings (Lecture Notes in Computer Science), Vol. 2076. Springer, 322–333.
DOI: Google ScholarCross Ref - [16] . 2015. Is polynomial time choiceless?. In Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday (Lecture Notes in Computer Science), , , , , and (Eds.), Vol. 9300. Springer, 193–209.
DOI: Google ScholarCross Ref - [17] . 2019. Rank logic is dead, long live rank logic!J. Symb. Log. 84, 1 (2019), 54–87.
DOI: Google ScholarCross Ref - [18] . 2008. The quest for a logic capturing PTIME. In Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA. IEEE Computer Society, 267–271.
DOI: Google ScholarDigital Library - [19] . 2010. Fixed-point definability and polynomial time on graphs with excluded minors. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom. IEEE Computer Society, 179–188.
DOI: Google ScholarDigital Library - [20] . 2019. Canonisation and definability for graphs of bounded rank width. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. IEEE, 1–13.
DOI: Google ScholarCross Ref - [21] . 1996. On finite rigid structures. J. Symb. Log. 61, 2 (1996), 549–562.
DOI: Google ScholarCross Ref - [22] . 1996. Logical hierarchies in PTIME. Inf. Comput. 129, 1 (1996), 1–19.
DOI: Google ScholarDigital Library - [23] . 2011. Descriptive Complexity of Linear Algebra. Ph.D. Dissertation. University of Cambridge, UK. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609435Google Scholar
- [24] . 1987. Expressibility as a complexity measure: Results and directions. In Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987. IEEE Computer Society.Google Scholar
- [25] . 2011. The Structure of Graphs and New Logics for the Characterization of Polynomial Time. Ph.D. Dissertation. Humboldt University of Berlin.
DOI: Google ScholarCross Ref - [26] . 2021. Separating rank logic from polynomial time. In 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE, 1–13.
DOI: Google ScholarDigital Library - [27] . 2021. Canonization for bounded and dihedral color classes in choiceless polynomial time. In 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference) (LIPIcs), and (Eds.), Vol. 183. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 31:1–31:18.
DOI: Google ScholarCross Ref - [28] . 2017. Benchmark graphs for practical graph isomorphism. In 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria (LIPIcs), and (Eds.), Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 60:1–60:14.
DOI: Google ScholarCross Ref - [29] . 1997. Bounded Variable Logics and Counting - a Study in Finite Models.
Lecture Notes in Logic , Vol. 9. Springer. Google ScholarCross Ref - [30] . 2016. Linear Equation Systems and the Search for a Logical Characterisation of Polynomial Time. Ph.D. Dissertation. RWTH Aachen University. https://logic.rwth-aachen.de/pakusa/diss.pdfGoogle Scholar
- [31] . 2016. Definability of cai-fürer-immerman problems in choiceless polynomial time. In 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France (LIPIcs), and (Eds.), Vol. 62. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 19:1–19:17.
DOI: Google ScholarCross Ref - [32] . 1963. Regular graphs with given girth and restricted circuits. J. London Math. Soc. s1-38, 1 (1963), 423–429.
DOI: Google ScholarCross Ref - [33] . 2014. Choiceless polynomial time on structures with small abelian colour classes. In Mathematical Foundations of Computer Science 2014-39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I (Lecture Notes in Computer Science), , , and (Eds.), Vol. 8634. Springer, 50–62.
DOI: Google ScholarCross Ref
Index Terms
- Separating Rank Logic from Polynomial Time
Recommendations
Separating rank logic from polynomial time
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer ScienceIn the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends fixed-point logic with counting by a rank operator over prime fields. We show that the isomorphism ...
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
Choiceless Polynomial Time (CPT) is one of the most promising candidates in the search for a logic capturing Ptime. The question whether there is a logic that expresses exactly the polynomial-time computable properties of finite structures, which has ...
Choiceless Polynomial Time with Witnessed Symmetric Choice
LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer ScienceWe extend Choiceless Polynomial Time (CPT), the currently only remaining promising candidate in the quest for a logic capturing Ptime, so that this extended logic has the following property: for every class of structures for which isomorphism is ...
Comments