Holographic algorithms without matchgates

J. M. Landsberg, Jason Ryder Morton, Serguei Norine

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, surprised the complexity community by showing certain problems, very similar to #P complete problems, were in fact in the class P. In particular, the theory produces algebraic tests for a problem to be in P. In this article we describe the geometric basis of these algorithms by (i) replacing the construction of graph fragments in the procedure by the direct construction of a skew symmetric matrix, and (ii) replacing the computation of weighted perfect matchings of an auxiliary graph by computing the Pfaffian of the directly constructed skew-symmetric matrix. This procedure indicates a more geometric approach to complexity classes. It also leads to more general constructions where one replaces the "Grassmann-Plücker identities" which test for admissibility by other algebraic tests. Natural problems treatable by these methods have been previously considered in a different context, and we present one such example.

Original languageEnglish (US)
Pages (from-to)782-795
Number of pages14
JournalLinear Algebra and Its Applications
Volume438
Issue number2
DOIs
StatePublished - Jan 15 2013

Fingerprint

Skew symmetric matrix
Counting Problems
Pfaffian
Algebraic Theory
Complexity Classes
Geometric Approach
Admissibility
Perfect Matching
Combinatorial Problems
Graph in graph theory
Polynomials
Polynomial-time Algorithm
Fragment
Computing
Community
Class
Context

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Cite this

Landsberg, J. M. ; Morton, Jason Ryder ; Norine, Serguei. / Holographic algorithms without matchgates. In: Linear Algebra and Its Applications. 2013 ; Vol. 438, No. 2. pp. 782-795.
@article{e30ed1ab7ac2409aaefb76aaa81f7b73,
title = "Holographic algorithms without matchgates",
abstract = "The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, surprised the complexity community by showing certain problems, very similar to #P complete problems, were in fact in the class P. In particular, the theory produces algebraic tests for a problem to be in P. In this article we describe the geometric basis of these algorithms by (i) replacing the construction of graph fragments in the procedure by the direct construction of a skew symmetric matrix, and (ii) replacing the computation of weighted perfect matchings of an auxiliary graph by computing the Pfaffian of the directly constructed skew-symmetric matrix. This procedure indicates a more geometric approach to complexity classes. It also leads to more general constructions where one replaces the {"}Grassmann-Pl{\"u}cker identities{"} which test for admissibility by other algebraic tests. Natural problems treatable by these methods have been previously considered in a different context, and we present one such example.",
author = "Landsberg, {J. M.} and Morton, {Jason Ryder} and Serguei Norine",
year = "2013",
month = "1",
day = "15",
doi = "10.1016/j.laa.2012.01.010",
language = "English (US)",
volume = "438",
pages = "782--795",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
publisher = "Elsevier Inc.",
number = "2",

}

Holographic algorithms without matchgates. / Landsberg, J. M.; Morton, Jason Ryder; Norine, Serguei.

In: Linear Algebra and Its Applications, Vol. 438, No. 2, 15.01.2013, p. 782-795.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Holographic algorithms without matchgates

AU - Landsberg, J. M.

AU - Morton, Jason Ryder

AU - Norine, Serguei

PY - 2013/1/15

Y1 - 2013/1/15

N2 - The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, surprised the complexity community by showing certain problems, very similar to #P complete problems, were in fact in the class P. In particular, the theory produces algebraic tests for a problem to be in P. In this article we describe the geometric basis of these algorithms by (i) replacing the construction of graph fragments in the procedure by the direct construction of a skew symmetric matrix, and (ii) replacing the computation of weighted perfect matchings of an auxiliary graph by computing the Pfaffian of the directly constructed skew-symmetric matrix. This procedure indicates a more geometric approach to complexity classes. It also leads to more general constructions where one replaces the "Grassmann-Plücker identities" which test for admissibility by other algebraic tests. Natural problems treatable by these methods have been previously considered in a different context, and we present one such example.

AB - The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, surprised the complexity community by showing certain problems, very similar to #P complete problems, were in fact in the class P. In particular, the theory produces algebraic tests for a problem to be in P. In this article we describe the geometric basis of these algorithms by (i) replacing the construction of graph fragments in the procedure by the direct construction of a skew symmetric matrix, and (ii) replacing the computation of weighted perfect matchings of an auxiliary graph by computing the Pfaffian of the directly constructed skew-symmetric matrix. This procedure indicates a more geometric approach to complexity classes. It also leads to more general constructions where one replaces the "Grassmann-Plücker identities" which test for admissibility by other algebraic tests. Natural problems treatable by these methods have been previously considered in a different context, and we present one such example.

UR - http://www.scopus.com/inward/record.url?scp=84869426367&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869426367&partnerID=8YFLogxK

U2 - 10.1016/j.laa.2012.01.010

DO - 10.1016/j.laa.2012.01.010

M3 - Article

AN - SCOPUS:84869426367

VL - 438

SP - 782

EP - 795

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

IS - 2

ER -