| Paper Abstract and Keywords |
| Presentation |
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 |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
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. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
satisfiability / exact algorithm / formula / parity gate / average-case hardness / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 112, no. 93, COMP2012-17, pp. 41-48, June 2012. |
| Paper # |
COMP2012-17 |
| Date of Issue |
2012-06-14 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| Download PDF |
COMP2012-17 |
| Conference Information |
| Committee |
COMP |
| Conference Date |
2012-06-21 - 2012-06-21 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
Hokkaido University |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2012-06-COMP |
| Language |
English |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis |
| Sub Title (in English) |
|
| Keyword(1) |
satisfiability |
| Keyword(2) |
exact algorithm |
| Keyword(3) |
formula |
| Keyword(4) |
parity gate |
| Keyword(5) |
average-case hardness |
| Keyword(6) |
|
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Kazuhisa Seto |
| 1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
| 2nd Author's Name |
Suguru Tamaki |
| 2nd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| 21st Author's Name |
|
| 21st Author's Affiliation |
() |
| 22nd Author's Name |
|
| 22nd Author's Affiliation |
() |
| 23rd Author's Name |
|
| 23rd Author's Affiliation |
() |
| 24th Author's Name |
|
| 24th Author's Affiliation |
() |
| 25th Author's Name |
|
| 25th Author's Affiliation |
() |
| 26th Author's Name |
/ / |
| 26th Author's Affiliation |
()
() |
| 27th Author's Name |
/ / |
| 27th Author's Affiliation |
()
() |
| 28th Author's Name |
/ / |
| 28th Author's Affiliation |
()
() |
| 29th Author's Name |
/ / |
| 29th Author's Affiliation |
()
() |
| 30th Author's Name |
/ / |
| 30th Author's Affiliation |
()
() |
| 31st Author's Name |
/ / |
| 31st Author's Affiliation |
()
() |
| 32nd Author's Name |
/ / |
| 32nd Author's Affiliation |
()
() |
| 33rd Author's Name |
/ / |
| 33rd Author's Affiliation |
()
() |
| 34th Author's Name |
/ / |
| 34th Author's Affiliation |
()
() |
| 35th Author's Name |
/ / |
| 35th Author's Affiliation |
()
() |
| 36th Author's Name |
/ / |
| 36th Author's Affiliation |
()
() |
| Speaker |
Author-1 |
| Date Time |
2012-06-21 13:20:00 |
| Presentation Time |
25 minutes |
| Registration for |
COMP |
| Paper # |
COMP2012-17 |
| Volume (vol) |
vol.112 |
| Number (no) |
no.93 |
| Page |
pp.41-48 |
| #Pages |
8 |
| Date of Issue |
2012-06-14 (COMP) |