講演抄録/キーワード |
講演名 |
2012-06-21 13:20
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis ○Kazuhisa Seto・Suguru Tamaki(Kyoto Univ.) COMP2012-17 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis.
For formulas of size at most $cn$, our algorithm runs in time $2^{(1-\mu_c)n}$ for some constant $\mu_c>0$.
As a byproduct of the running time analysis of our algorithm,
we get strong average-case hardness of affine extractors for linear-sized formulas over the full binary basis. |
キーワード |
(和) |
/ / / / / / / |
(英) |
satisfiability / exact algorithm / formula / parity gate / average-case hardness / / / |
文献情報 |
信学技報, vol. 112, no. 93, COMP2012-17, pp. 41-48, 2012年6月. |
資料番号 |
COMP2012-17 |
発行日 |
2012-06-14 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2012-17 |