Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2016-10-21 14:30
On lower bounds for the complexity of the Frobenius problem and its subproblems
Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-28
Abstract (in Japanese) (See Japanese page) 
(in English) In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive integers,we call an integer $g(A)$ the {itshape Frobenius number} if $g(A)$ is the maximum among integers that cannot be represented as nonnegative integer combinations of $A$. We call the problem of finding $g(A)$ for a given set $A$ of coprime positive integers the {itshape Frobenius problem}. A lot of fast practical algorithms were developed while this problem is known to be computationally hard. However, the results on lower bounds for its time complexity have never been known. We initiate to investigate lower bounds for the time complexity of the Frobenius problem.
Keyword (in Japanese) (See Japanese page) 
(in English) Frobenius problem / Frobenius number / computational complexity / lower bound for the time complexity / shortest path problem / / /  
Reference Info. IEICE Tech. Rep., vol. 116, no. 262, COMP2016-28, pp. 35-37, Oct. 2016.
Paper # COMP2016-28 
Date of Issue 2016-10-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 COMP2016-28

Conference Information
Committee COMP  
Conference Date 2016-10-21 - 2016-10-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Tohoku University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2016-10-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On lower bounds for the complexity of the Frobenius problem and its subproblems 
Sub Title (in English)  
Keyword(1) Frobenius problem  
Keyword(2) Frobenius number  
Keyword(3) computational complexity  
Keyword(4) lower bound for the time complexity  
Keyword(5) shortest path problem  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shunichi Matsubara  
1st Author's Affiliation Aoyama Gakuin University (Aoyama Gakuin Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
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 2016-10-21 14:30:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2016-28 
Volume (vol) vol.116 
Number (no) no.262 
Page pp.35-37 
#Pages 3 
Date of Issue 2016-10-14 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan