. . "Applied statistics, operational research." . . . . . . . . . . . . . . . . "A midly expoential approximation algorithm for the permanent"@en . . . . . "A mildly exponential algorithm for the permanent"@en . . . . . . "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 . . . . "A mildly exponential approximation algorithm for the permanent"@en . "A mildly exponential approximation algorithm for the permanent" . "A midly exponential approximation algorithm for the permanent" . "Mathematics." . . "University of Edinburgh. Laboratory for Foundation of Computer Science." . .