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

Logic and Machines最新文献

筛选
英文 中文
Universal Turing machines (UTM) and Jones-Matijasevich-masking 通用图灵机(UTM)和Jones-Matijasevich-masking
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_44
G. Hasenjaeger
{"title":"Universal Turing machines (UTM) and Jones-Matijasevich-masking","authors":"G. Hasenjaeger","doi":"10.1007/3-540-13331-3_44","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_44","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"49 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":"127138373","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}
引用次数: 3
On the argument complexity of multiply transitive Boolean functions 关于多重传递布尔函数的参数复杂度
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_54
Ulrich Hedtstück
{"title":"On the argument complexity of multiply transitive Boolean functions","authors":"Ulrich Hedtstück","doi":"10.1007/3-540-13331-3_54","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_54","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"149 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":"127268089","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
Proving lower bounds of the monotone complexity of Boolean functions 证明布尔函数单调复杂度的下界
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_58
I. Wegener
{"title":"Proving lower bounds of the monotone complexity of Boolean functions","authors":"I. Wegener","doi":"10.1007/3-540-13331-3_58","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_58","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"20 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":"116626212","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
Second order spectra 二阶谱
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_53
B. Scarpellini
{"title":"Second order spectra","authors":"B. Scarpellini","doi":"10.1007/3-540-13331-3_53","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_53","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"28 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":"116715863","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}
引用次数: 2
Arithmetical degrees of index sets for complexity classes 复杂度类索引集的算术度
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_37
Kenneth W. Regan
{"title":"Arithmetical degrees of index sets for complexity classes","authors":"Kenneth W. Regan","doi":"10.1007/3-540-13331-3_37","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_37","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"45 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":"128956467","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 computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) 无约束有限多米诺问题的计算复杂性(对逻辑决策问题的启示)
Logic and Machines Pub Date : 1983-05-23 DOI: 10.1007/3-540-13331-3_48
Martin Fürer
{"title":"The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)","authors":"Martin Fürer","doi":"10.1007/3-540-13331-3_48","DOIUrl":"https://doi.org/10.1007/3-540-13331-3_48","url":null,"abstract":"","PeriodicalId":190231,"journal":{"name":"Logic and Machines","volume":"11 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":"122395005","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}
引用次数: 53
首页 上一页
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学术官方微信