WorldCat Linked Data Explorer

http://worldcat.org/entity/work/id/476306363

A midly expoential approximation algorithm for the permanent

Abstract: "A new approximation algorithm for the permanent of an n x n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e[superscipt theta(n)]."

Open All Close All

http://schema.org/description

  • "Abstract: "A new approximation algorithm for the permanent of an n x n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e[superscipt theta(n)].""@en

http://schema.org/name

  • "A midly expoential approximation algorithm for the permanent"@en
  • "A mildly exponential algorithm for the permanent"@en
  • "A mildly exponential approximation algorithm for the permanent"
  • "A mildly exponential approximation algorithm for the permanent"@en
  • "A midly exponential approximation algorithm for the permanent"