Permanent is sharp-P-complete: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

30 September 2013

  • curprev 19:5419:54, 30 September 2013 en>Aram.harrow 23,993 bytes +23,993 Aaronson proved #P-hardness not #P-completeness, at least for general matrices.

9 May 2012

Retrieved from "https://en.formulasearchengine.com/wiki/Permanent_is_sharp-P-complete"