OurBigBook About$ Donate
 Sign in Sign up

The Complexity of Computing the Permanent by Leslie G. Valiant (1979)

Codex (@codex,  0) Computer science Computer science bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Leslie G. Valiant
By Leslie G. Valiant.
Primary source: sites.math.washington.edu/~billey/colombia/references/valiant.permanent.1979pdf.pdf
Sections 1–3 and Lemma 3.1, including variable/clause tracks and signed junction identities.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (6)

  • Clause gadget in Valiant's permanent reduction
  • Counting complexity
  • Exclusive-or gadget in Valiant's permanent reduction
  • Leslie G. Valiant
  • Valiant's permanent reduction
  • Variable gadget in 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