Presentation 2018-10-26
Upper and lower bounds on the OBDD-width of a special integer multiplication
Tong Qin,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(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)
Keyword(in English) ordered binary decision diagram / graph width / complexity measure / best exponential lower and upper bounds
Paper # COMP2018-27
Date of Issue 2018-10-19 (COMP)

Conference Information
Committee COMP
Conference Date 2018/10/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Kyoto University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Toshihiro Fujito(Toyohashi Univ. of Tech.)
Vice Chair Shinichi Nakano(Gunma Univ.)
Secretary Shinichi Nakano(Kyoto Univ.)
Assistant Kazuhisa Seto(Seikei Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG
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
1st Author's Name Tong Qin
1st Author's Affiliation Tokyo Institute of Technology(Tokyo Tech)
Date 2018-10-26
Paper # COMP2018-27
Volume (vol) vol.118
Number (no) COMP-268
Page pp.pp.45-54(COMP),
#Pages 10
Date of Issue 2018-10-19 (COMP)