Paper Abstract and Keywords |
Presentation |
2007-06-29 10:30
Towards closing a gap between worst-case and average-case NP hardness Akinori Kawachi, Osamu Watanabe (Tokyo Inst. of Tech.) COMP2007-21 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
It is significant in the computational complexity theory and the foundations
of cryptography to construct problems hard on average from worst-case hardness assumptions. We construct NP search and DP decision problems that are not efficiently solvable with high probability over positive instances w.r.t. some samplable distributions under the assumption that NP-hard problems are not efficiently solvable in the worst case. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
average-case complexity / NP-hard problems / samplable distributions / worst case to average case reductions / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 107, no. 127, COMP2007-21, pp. 25-32, June 2007. |
Paper # |
COMP2007-21 |
Date of Issue |
2007-06-22 (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 |
COMP2007-21 |
Conference Information |
Committee |
COMP |
Conference Date |
2007-06-29 - 2007-06-29 |
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 |
2007-06-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Towards closing a gap between worst-case and average-case NP hardness |
Sub Title (in English) |
|
Keyword(1) |
average-case complexity |
Keyword(2) |
NP-hard problems |
Keyword(3) |
samplable distributions |
Keyword(4) |
worst case to average case reductions |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Akinori Kawachi |
1st Author's Affiliation |
Tokyo Institute of Technology (Tokyo Inst. of Tech.) |
2nd Author's Name |
Osamu Watanabe |
2nd Author's Affiliation |
Tokyo Institute of Technology (Tokyo Inst. of Tech.) |
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 |
() |
Speaker |
Author-1 |
Date Time |
2007-06-29 10:30:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2007-21 |
Volume (vol) |
vol.107 |
Number (no) |
no.127 |
Page |
pp.25-32 |
#Pages |
8 |
Date of Issue |
2007-06-22 (COMP) |