布尔电路不同等价和审计问题的复杂度分类

IF 0.6 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Logical Methods in Computer Science Pub Date : 2010-09-07 DOI:10.2168/LMCS-8(3:31)2012

Elmar BAPhler, N. Creignou, Matthias Galota, S. Reith, Henning Schnoor, H. Vollmer

{"title":"布尔电路不同等价和审计问题的复杂度分类","authors":"Elmar BAPhler, N. Creignou, Matthias Galota, S. Reith, Henning Schnoor, H. Vollmer","doi":"10.2168/LMCS-8(3:31)2012","DOIUrl":null,"url":null,"abstract":"We study Boolean circuits as a representation of Boolean functions and\nconsider different equivalence, audit, and enumeration problems. For a number\nof restricted sets of gate types (bases) we obtain efficient algorithms, while\nfor all other gate types we show these problems are at least NP-hard.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2010-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITS\",\"authors\":\"Elmar BAPhler, N. Creignou, Matthias Galota, S. Reith, Henning Schnoor, H. Vollmer\",\"doi\":\"10.2168/LMCS-8(3:31)2012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study Boolean circuits as a representation of Boolean functions and\\nconsider different equivalence, audit, and enumeration problems. For a number\\nof restricted sets of gate types (bases) we obtain efficient algorithms, while\\nfor all other gate types we show these problems are at least NP-hard.\",\"PeriodicalId\":49904,\"journal\":{\"name\":\"Logical Methods in Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2010-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logical Methods in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.2168/LMCS-8(3:31)2012\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logical Methods in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2168/LMCS-8(3:31)2012","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 3

摘要

我们研究布尔电路作为布尔函数的表示，并考虑不同的等价、审计和枚举问题。对于许多受限的门类型(基)，我们获得了有效的算法，而对于所有其他门类型，我们证明这些问题至少是np困难的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITS

We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Logical Methods in Computer Science 工程技术-计算机：理论方法

CiteScore

1.80

自引率

0.00%

发文量

105

审稿时长

6-12 weeks

期刊介绍： Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author. Topics of Logical Methods in Computer Science: Algebraic methods Automata and logic Automated deduction Categorical models and logic Coalgebraic methods Computability and Logic Computer-aided verification Concurrency theory Constraint programming Cyber-physical systems Database theory Defeasible reasoning Domain theory Emerging topics: Computational systems in biology Emerging topics: Quantum computation and logic Finite model theory Formalized mathematics Functional programming and lambda calculus Inductive logic and learning Interactive proof checking Logic and algorithms Logic and complexity Logic and games Logic and probability Logic for knowledge representation Logic programming Logics of programs Modal and temporal logics Program analysis and type checking Program development and specification Proof complexity Real time and hybrid systems Reasoning about actions and planning Satisfiability Security Semantics of programming languages Term rewriting and equational logic Type theory and constructive mathematics.