Paper Abstract and Keywords |
Presentation |
2013-10-18 16:25
An Algorithm for the coin-exchange problem of Frobenius using a parse table Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2013-37 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
The coin-exchange problem of Frobenius is a problem that finds the Frobenius number for relatively prime positive integers A1,A2,...,Ad, The Frobenius number is the largest integer that is not representable as a non-negative integer combination of A1,A2,...,Adj. Birman-Ullman's algorithm is a parsing algorithm for a context-free grammar, which employs dynamic programming. In this paper, a new algorithm is proposed for Frobenius problem using Birman-Ullman's algorithm. It constructs a string and a context-free grammar for a Frobenius problem, generates a table from the string and the grammar by Birman-Ullman's algorithm, and finds the Frobenius number from the table. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Frobenius number / coin-exchange problem / parsing / dynamic programming / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 113, no. 252, COMP2013-37, pp. 25-28, Oct. 2013. |
Paper # |
COMP2013-37 |
Date of Issue |
2013-10-11 (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 |
COMP2013-37 |
Conference Information |
Committee |
COMP |
Conference Date |
2013-10-18 - 2013-10-18 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Nagoya Institute of Technology |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2013-10-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An Algorithm for the coin-exchange problem of Frobenius using a parse table |
Sub Title (in English) |
|
Keyword(1) |
Frobenius number |
Keyword(2) |
coin-exchange problem |
Keyword(3) |
parsing |
Keyword(4) |
dynamic programming |
Keyword(5) |
|
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 |
() |
Speaker |
Author-1 |
Date Time |
2013-10-18 16:25:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2013-37 |
Volume (vol) |
vol.113 |
Number (no) |
no.252 |
Page |
pp.25-28 |
#Pages |
4 |
Date of Issue |
2013-10-11 (COMP) |
|