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 2014-12-05 11:00
On Zero-Suppressed Binary Decision Diagrams and Complexity Theory
Hiroki Morizumi (Shimane Univ.) COMP2014-34
Abstract (in Japanese) (See Japanese page) 
(in English) Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On the other hand, BDDs are also called branching programs in complexity theory, and have been studied as a computation model. In this paper, we consider ZDDs as a computation model from the viewpoint of complexity theory. When we consider ZDDs in complexity theory, the first question is whether the class of decision problems solvable by a nonuniform family of polynomial-size (unordered) ZDDs is equal to {sf L/poly} or not. In this paper, we prove some results related to the question.
Keyword (in Japanese) (See Japanese page) 
(in English) zero-suppressed binary decision diagram / branching program / complexity class / / / / /  
Reference Info. IEICE Tech. Rep., vol. 114, no. 352, COMP2014-34, pp. 17-19, Dec. 2014.
Paper # COMP2014-34 
Date of Issue 2014-11-28 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
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 COMP2014-34

Conference Information
Committee COMP  
Conference Date 2014-12-05 - 2014-12-05 
Place (in Japanese) (See Japanese page) 
Place (in English) Sojo University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2014-12-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Zero-Suppressed Binary Decision Diagrams and Complexity Theory 
Sub Title (in English)  
Keyword(1) zero-suppressed binary decision diagram  
Keyword(2) branching program  
Keyword(3) complexity class  
1st Author's Name Hiroki Morizumi  
1st Author's Affiliation Shimane University (Shimane 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 2014-12-05 11:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2014-34 
Volume (vol) vol.114 
Number (no) no.352 
Page pp.17-19 
Date of Issue 2014-11-28 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]

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