Skip to main navigation Skip to search Skip to main content

Matchgate Signatures Under Variable Permutations

  • Boning Meng
  • , Yicheng Pan*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work, we introduce the concept of permutable matchgate signatures and leverage it to establish dichotomy theorems for #CSP and #RD-CSP (D ≥ 3) on planar graphs without the variable ordering restriction. We also present a complete characterization of permutable matchgate signatures and their relationship to symmetric signatures. Besides, we give a sufficient and necessary condition for determining whether a matchgate signature retains its property under a certain variable permutation, which can be checked in polynomial time. In addition, we prove a dichotomy for Pl-#RD-CSP (D ≥ 3), where the variable ordering restriction exists.

Original languageEnglish
Title of host publication36th International Symposium on Algorithms and Computation, ISAAC 2025
EditorsHo-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959774086
DOIs
StatePublished - 2025
Event36th International Symposium on Algorithms and Computation, ISAAC 2025 - Tainan, Taiwan, Province of China
Duration: 7 Dec 202510 Dec 2025

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume359
ISSN (Print)1868-8969

Conference

Conference36th International Symposium on Algorithms and Computation, ISAAC 2025
Country/TerritoryTaiwan, Province of China
CityTainan
Period7/12/2510/12/25

Keywords

  • Computational Complexity
  • Counting CSP
  • Matchgate Signature

Fingerprint

Dive into the research topics of 'Matchgate Signatures Under Variable Permutations'. Together they form a unique fingerprint.

Cite this