A class of boolean functions with linear combinational complexity-Reference-Cited by-同舟云学术

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

A class of boolean functions with linear combinational complexity

Published:1975-12 Issue:2 Volume:1 Page:161-183
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Harper L.H.,Hsieh W.N.,Savage J.E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Practical decidability;Ehrenfeucht,1972

2. The Complexity of the marriage problem;Harper;Advances in Math.,1972

3. Intersection theorems for systems of finite vector spaces and other combinatorial results;Hsieh,1974

4. An Upper Bound for the Complexity of P3,5 Functions;Hsieh;M.I.T. Project MAC Technical Report,1974

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

1. Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables;Computational Mathematics and Modeling;2013-01

2. Boolean Functions Derived from Pseudorandom Binary Sequences;Lecture Notes in Computer Science;2012

3. Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q−1;Discrete Applied Mathematics;2003-05

4. Cosmological lower bound on the circuit complexity of a small problem in logic;Journal of the ACM;2002-11

5. Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions;Electronic Notes in Discrete Mathematics;2001-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP