布尔函数的拓扑学方面

IF 0.5 4区数学 Q3 MATHEMATICS

Pure and Applied Mathematics Quarterly Pub Date : 2024-05-15 DOI:10.4310/pamq.2024.v20.n3.a1

Anders Björner, Mark Goresky, Robert MacPherson

引用次数: 0

摘要

我们将讨论如何利用拓扑学工具来推导布尔函数的电路复杂度下限。

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

查看原文本刊更多论文

Topological aspects of Boolean functions

We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.

求助全文

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

来源期刊

Pure and Applied Mathematics Quarterly 数学-数学

CiteScore

0.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Publishes high-quality, original papers on all fields of mathematics. To facilitate fruitful interchanges between mathematicians from different regions and specialties, and to effectively disseminate new breakthroughs in mathematics, the journal welcomes well-written submissions from all significant areas of mathematics. The editors are committed to promoting the highest quality of mathematical scholarship.