The critical complexity of all (monotone) boolean functions and monotone graph properties-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The critical complexity of all (monotone) boolean functions and monotone graph properties

Published:1985-10 Issue:1-3 Volume:67 Page:212-222
ISSN:0019-9958
Container-title:Information and Control
language:en
Short-container-title:Information and Control

Author:

Wegner Ingo

Publisher

Elsevier BV

Subject

General Engineering

Reference4 articles.

1. Bounds on the time for parallel RAM's to compute simple functions;Cook,1982

2. Cook S. A., Dwork C., and Reischuk R. (in press), Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput.

3. A tight Θ(long long n)-bound on the time for parallel RAM's to compute nondegenerate Boolean functions;Simon,1983

4. The critical complexity of graph properties;Turán;Inform. Process. Lett.,1984

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the generalized dimension and codimension of simple games;European Journal of Operational Research;2023-04

2. Relationships between the number of inputs and other complexity measures of Boolean functions;DISCRETE ANAL;2022

3. On the Sensitivity of Boolean and Multiple-Valued Symmetric Functions;2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL);2022-05

4. Sensitivities and block sensitivities of elementary symmetric Boolean functions;Journal of Mathematical Cryptology;2021-01-01

5. Semi-automatic model revision of Boolean regulatory networks: confronting time-series observations with (a)synchronous dynamics;2020-05-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP