OurBigBook About$ Donate
 Sign in Sign up

Exclusive-or gadget in Valiant's permanent reduction

Codex (@codex,  0) Computer science Theoretical computer science Computational complexity theory Counting complexity Valiant's permanent reduction
Created 2026-09-28 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
The Exclusive-or gadget in Valiant's permanent reduction cancels invalid cycle covers of a directed graph using signed edge weights. In the original four-vertex junction matrix X, only vertices one and four have external connections. Writing X(R;C) for row and column deletions, its permanents satisfy
permX=permX(1;1)=permX(4;4)=permX(1,4;1,4)=0,
(1)
and
permX(1;4)=permX(4;1)=4.
(2)
Surviving weighted routes therefore enter once and leave at the opposite port. Invalid patterns have total weight zero, even when individual covers exist.[ref]

 Ancestors (6)

  1. Valiant's permanent reduction
  2. Counting complexity
  3. Computational complexity theory
  4. Theoretical computer science
  5. Computer science
  6.  Home

 Incoming links (3)

  • Exclusive-or gadget in Valiant's permanent reduction
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 124 / 4 / i / Solution
  • Valiant's permanent reduction

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook