发布求助
文献互助 智能选刊 最新文献

Logic and Machines最新文献

筛选
英文 中文
P-mitotic sets P-mitotic集
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_30
K. Ambos-Spies
{"title":"P-mitotic sets","authors":"K. Ambos-Spies","doi":"10.1007/3-540-13331-3_30","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_30","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126240272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 48
The VLSI complexity of Boolean functions 布尔函数的VLSI复杂度
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_55
M. Kramer, J. Leeuwen
{"title":"The VLSI complexity of Boolean functions","authors":"M. Kramer, J. Leeuwen","doi":"10.1007/3-540-13331-3_55","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_55","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116963885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Fast parallel algorithms for finding all prime implicants for discrete functions 求离散函数所有素数隐含式的快速并行算法
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_56
W. Oberschelp
{"title":"Fast parallel algorithms for finding all prime implicants for discrete functions","authors":"W. Oberschelp","doi":"10.1007/3-540-13331-3_56","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_56","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125567347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Reductions for the satisfiability with a simple interpretation of the predicate variable 对谓词变量的简单解释的可满足性的约简
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_47
M. Deutsch
{"title":"Reductions for the satisfiability with a simple interpretation of the predicate variable","authors":"M. Deutsch","doi":"10.1007/3-540-13331-3_47","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_47","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115866565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On the complement of one complexity class in another 一个复杂度类在另一个复杂度类中的补充
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_34
D. Schmidt
{"title":"On the complement of one complexity class in another","authors":"D. Schmidt","doi":"10.1007/3-540-13331-3_34","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_34","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133709981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Rudimentary relations and Turing machines with linear alternation 基本关系与线性交替的图灵机
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_38
H. Volger
{"title":"Rudimentary relations and Turing machines with linear alternation","authors":"H. Volger","doi":"10.1007/3-540-13331-3_38","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_38","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133767463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Modular machines, undecidability and incompleteness 组合机器，不可判定性和不完备性
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_43
D. Cohen
{"title":"Modular machines, undecidability and incompleteness","authors":"D. Cohen","doi":"10.1007/3-540-13331-3_43","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_43","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124510746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recursively enumerable extensions of R1 by finite functions 有限函数对R1的递归可枚举扩展
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_33
W. Menzel, V. Sperschneider
{"title":"Recursively enumerable extensions of R1 by finite functions","authors":"W. Menzel, V. Sperschneider","doi":"10.1007/3-540-13331-3_33","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_33","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126337224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
The length-problem 的length-problem
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_35
V. Sperschneider
{"title":"The length-problem","authors":"V. Sperschneider","doi":"10.1007/3-540-13331-3_35","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_35","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127259711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Extensible algorithms
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_40
H. Carstens, Peter Päppinghaus
{"title":"Extensible algorithms","authors":"H. Carstens, Peter Päppinghaus","doi":"10.1007/3-540-13331-3_40","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_40","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121564997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信