IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2019-12-13 14:35
On a formula for Boolean expressions of Conjunctive normal form and computational complexity
Tomoya Machide (NII) COMP2019-37
Abstract (in Japanese) (See Japanese page) 
(in English) An Boolean expression in conjunctive normal form, abbreviated as CNF, is used as a canonical normal form in Boolean logic, including SAT problem. In this talk, we introduce a mathematical formula for a CNF-SAT problem, and give an application to computational complexity.
Keyword (in Japanese) (See Japanese page) 
(in English) SAT problem / CNF / mathematical formula / complexity / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 340, COMP2019-37, pp. 55-59, Dec. 2019.
Paper # COMP2019-37 
Date of Issue 2019-12-06 (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. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2019-37

Conference Information
Committee COMP  
Conference Date 2019-12-13 - 2019-12-13 
Place (in Japanese) (See Japanese page) 
Place (in English) Ikaho Seminar House, Gunma University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2019-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On a formula for Boolean expressions of Conjunctive normal form and computational complexity 
Sub Title (in English)  
Keyword(1) SAT problem  
Keyword(2) CNF  
Keyword(3) mathematical formula  
Keyword(4) complexity  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Tomoya Machide  
1st Author's Affiliation National Institute of Infomatics (NII)
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
Date Time 2019-12-13 14:35:00 
Presentation Time 25 
Registration for COMP 
Paper # IEICE-COMP2019-37 
Volume (vol) IEICE-119 
Number (no) no.340 
Page pp.55-59 
#Pages IEICE-5 
Date of Issue IEICE-COMP-2019-12-06 


[Return to Top Page]

[Return to IEICE Web Page]


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