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

Discrete Mathematics and Theoretical Computer Science最新文献

筛选
英文 中文
On the Structure of Valiant's Complexity Classes 论Valiant的复杂性类的结构
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 1998-02-25 DOI: 10.46298/dmtcs.260
Peter Bürgisser
{"title":"On the Structure of Valiant's Complexity Classes","authors":"Peter Bürgisser","doi":"10.46298/dmtcs.260","DOIUrl":"https://doi.org/10.46298/dmtcs.260","url":null,"abstract":"In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of polynomials over a field. We further develop this theory in the spirit of structural complexity and obtain analogues of well-known results by Baker, Gill, and Solovay, Ladner, and Schoning. We show that if Valiant's hypothesis is true, then there is a p -definable family, which is neither p -computable nor VNP -complete. More generally, we define the posets of p -degrees and c -degrees of p -definable families and prove that any countable poset can be embedded in either of them, provided Valiant's hypothesis is true. Moreover, we establish the existence of minimal pairs for VP in VNP . Over finite fields, we give a specific example of a family of polynomials which is neither VNP -complete nor p -computable, provided the polynomial hierarchy does not collapse. We define relativized complexity classes VP h and VNP h and construct complete families in these classes. Moreover, we prove that there is a p -family h satisfying VP h = VNP h .","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"1998-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79676011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Quantum Logic 量子逻辑
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 1998-01-01 DOI: 10.1007/3-540-28303-x_14
K. Svozil
{"title":"Quantum Logic","authors":"K. Svozil","doi":"10.1007/3-540-28303-x_14","DOIUrl":"https://doi.org/10.1007/3-540-28303-x_14","url":null,"abstract":"","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74954236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 425
Partition and composition matrices: two matrix analogues of set partitions 划分和组合矩阵:集合划分的两个矩阵类比
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.46298/DMTCS.2905
Anders Claesson, M. Dukes, Martina Kubitzke
{"title":"Partition and composition matrices: two matrix analogues of set partitions","authors":"Anders Claesson, M. Dukes, Martina Kubitzke","doi":"10.46298/DMTCS.2905","DOIUrl":"https://doi.org/10.46298/DMTCS.2905","url":null,"abstract":"This paper introduces two matrix analogues for set partitions; partition and composition matrices. These two analogues are the natural result of lifting the mapping between ascent sequences and integer matrices given in Dukes & Parviainen (2010). We prove that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing inversion tables are shown to correspond to partition matrices with a row ordering relation. Partition matrices which are s-diagonal are classified in terms of inversion tables. Bidiagonal partition matrices are enumerated using the transfer-matrix method and are equinumerous with permutations which are sortable by two pop-stacks in parallel. We show that composition matrices on the set $X$ are in one-to-one correspondence with (2+2)-free posets on $X$.We show that pairs of ascent sequences and permutations are in one-to-one correspondence with (2+2)-free posets whose elements are the cycles of a permutation, and use this relation to give an expression for the number of (2+2)-free posets on ${1,ldots,n}$.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70480957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Degree Distribution of Thickened Trees 加厚树木的度分布
IF 0.7 4区 数学
Discrete Mathematics and Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.46298/DMTCS.3561
M. Drmota, Bernhard Gittenberger, A. Panholzer
{"title":"The Degree Distribution of Thickened Trees","authors":"M. Drmota, Bernhard Gittenberger, A. Panholzer","doi":"10.46298/DMTCS.3561","DOIUrl":"https://doi.org/10.46298/DMTCS.3561","url":null,"abstract":"We develop a combinatorial structure to serve as model of random real world networks. Starting with plane oriented recursive trees we substitute the nodes by more complex graphs. In such a way we obtain graphs having a global tree-like structure while locally looking clustered. This fits with observations obtained from real-world networks. In particular we show that the resulting graphs are scale-free, that is, the degree distribution has an asymptotic power law.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70481070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信