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 2018-10-26 15:00
Upper and lower bounds on the OBDD-width of a special integer multiplication
Tong Qin (Tokyo Tech) COMP2018-27
Abstract (in Japanese) (See Japanese page) 
(in English) We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural numbers given as $n$ bit binary strings {boldmath $x$} and {boldmath $y$} from some restricted domain, and investigate the width of OBDDs computing ${rm SMul}_{n-1}^n$. We introduce a combinatorially defined function $s_*(n)$ and show that the width of OBDDs computing ${rm SMul}_{n-1}^n$ is $Theta(2^{s_*(n)})$.
Keyword (in Japanese) (See Japanese page) 
(in English) ordered binary decision diagram / graph width / complexity measure / best exponential lower and upper bounds / / / /  
Reference Info. IEICE Tech. Rep., vol. 118, no. 268, COMP2018-27, pp. 45-54, Oct. 2018.
Paper # COMP2018-27 
Date of Issue 2018-10-19 (COMP) 
ISSN 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 COMP2018-27

Conference Information
Committee COMP  
Conference Date 2018-10-26 - 2018-10-26 
Place (in Japanese) (See Japanese page) 
Place (in English) Kyoto University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2018-10-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Upper and lower bounds on the OBDD-width of a special integer multiplication 
Sub Title (in English)  
Keyword(1) ordered binary decision diagram  
Keyword(2) graph width  
Keyword(3) complexity measure  
Keyword(4) best exponential lower and upper bounds  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Tong Qin  
1st Author's Affiliation Tokyo Institute of Technology (Tokyo Tech)
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 2018-10-26 15:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2018-27 
Volume (vol) vol.118 
Number (no) no.268 
Page pp.45-54 
#Pages 10 
Date of Issue 2018-10-19 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan