approximation--♯P-complete

There are probabilistic algorithms that return good approximations to some #P-complete problems with high probability. This is one of the demonstrations of the power of probabilistic algorithms.
Many #P-complete problems have a fully polynomial-time randomized approximation scheme完全多項式時間乱択近似スキーム?!, or "FPRAS, " which, informally, will produce with high probability an approximation to an arbitrary degree of accuracy, in time that is polynomial with respect to both the size of the problem and the degree of accuracy required. Jerrum, Valiant, and Vazirani showed that every #P-complete problem either has an FPRAS, or is essentially impossible to approximate; if there is any polynomial-time algorithm which consistently produces an approximation of a #P-complete problem which is within a polynomial ratio in the size of the input of the exact answer, then that algorithm can be used to construct an FPRAS.
< https://en.wikipedia.org/wiki/Sharp-P-complete > ←< https://en.wikipedia.org/wiki/Hafnian >

↑↓
https://shinichiwanko2000.livedoor.blog/archives/29555317.html
2025年10月23日 computation, definition---Hafnianハフニアン

コメント

このブログの人気の投稿

after a long interval[separation ], for the first time in quite some time久しぶりのin-law 姻族インゾク?, grave cleaning墓掃除・・passingly[apropos折よい、適切な ]序ツイで? !に、done with kin親戚のも遣ヤっ付ツけてシモタ♪?? ?, ,[20250429 ]

co-opで、purchase買った・・〝easy as lite & folded軽くて折り畳みも簡単? ! 〟ori-con {ori-口 の開いた形状? ? } carry(持ち運び, , ) [20250625 ]

THE LIST,? ,, u.k. [20250611 ]