Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第10页

Logical paradoxes in quantum computation 量子计算中的逻辑悖论

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2017-08-31 DOI: 10.1145/3209108.3209123

Nadish de Silva

引用次数: 6

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics Clifford+T量子力学zx微积分的完全公理化

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2017-05-31 DOI: 10.1145/3209108.3209131

E. Jeandel, S. Perdrix, R. Vilmart

引用次数: 112

On the number of types in sparse graphs 关于稀疏图中类型的数量

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2017-05-25 DOI: 10.1145/3209108.3209178

Michal Pilipczuk, S. Siebertz, Szymon Toruńczyk

{"title":"On the number of types in sparse graphs","authors":"Michal Pilipczuk, S. Siebertz, Szymon Toruńczyk","doi":"10.1145/3209108.3209178","DOIUrl":"https://doi.org/10.1145/3209108.3209178","url":null,"abstract":"We prove that for every class of graphs ℒ which is nowhere dense, as defined by Nešetřil and Ossona de Mendez [28, 29], and for every first order formula φ(x, y), whenever one draws a graph G ∈ ℒ and a subset of its nodes A, the number of subsets of A|y| which are of the form {u ∈ A|y|: G |= φ(ū, v)} for some valuation ū of x in G is bounded by O(|A||x|ε), for every ε > 0. This provides optimal bounds on the VC-density of first-order definable set systems in nowhere dense graph classes. We also give two new proofs of upper bounds on quantities in nowhere dense classes which are relevant for their logical treatment. Firstly, we provide a new proof of the fact that nowhere dense classes are uniformly quasi-wide, implying explicit, polynomial upper bounds on the functions relating the two notions. Secondly, we give a new combinatorial proof of the result of Adler and Adler [1] stating that every nowhere dense class of graphs is stable. In contrast to the previous proofs of the above results, our proofs are completely finitistic and constructive, and yield explicit and computable upper bounds on quantities related to uniform quasi-wideness (margins) and stability (ladder indices).","PeriodicalId":389131,"journal":{"name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"43 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120900158","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}

引用次数: 29

Compositional Game Theory 组合博弈论

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2016-03-15 DOI: 10.1145/3209108.3209165

Neil Ghani, Jules Hedges, Viktor Winschel, Philipp Zahn

引用次数: 84