A Boolean function requiring 3n network size

Article Properties
Cite
Blum, Norbert. “A Boolean Function Requiring 3n Network Size”. Theoretical Computer Science, vol. 28, no. 3, 1983, pp. 337-45, https://doi.org/10.1016/0304-3975(83)90029-4.
Blum, N. (1983). A Boolean function requiring 3n network size. Theoretical Computer Science, 28(3), 337-345. https://doi.org/10.1016/0304-3975(83)90029-4
Blum, Norbert. “A Boolean Function Requiring 3n Network Size”. Theoretical Computer Science 28, no. 3 (1983): 337-45. https://doi.org/10.1016/0304-3975(83)90029-4.
Blum N. A Boolean function requiring 3n network size. Theoretical Computer Science. 1983;28(3):337-45.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
A 3n-lower bound on the network complexity of Boolean functions Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 10 1980
On the combinational complexity of certain symmetric Boolean functions 1977
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions SIAM Journal on Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 25 1977
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1974
A 2.75n-lower bound on the network complexity of boolean functions 1981
Refrences Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science6
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software3
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware3
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 6 is the most frequently represented among the references in this article. It primarily includes studies from SIAM Journal on Computing and Computing. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Improving $$3N$$ Circuit Complexity Lower Bounds computational complexity
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2023
Hay from the Haystack: Explicit Examples of Exponential Quantum Circuit Complexity Communications in Mathematical Physics
  • Science: Mathematics
  • Science: Physics
 1 2023
Is There an Oblivious RAM Lower Bound for Online Reads? Journal of Cryptology
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1 2021
Local reduction Information and Computation
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1 2018
On the limits of gate elimination Journal of Computer and System Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2018
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science29
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware23
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software23
Science: Mathematics7
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods7
Science: Science (General): Cybernetics: Information theory6
Technology: Technology (General): Industrial engineering. Management engineering: Information technology5
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication5
Science: Physics1
Technology: Engineering (General). Civil engineering (General)1
Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks1
Technology: Mechanical engineering and machinery1
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 29 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled An n3/2 lower bound on the monotone network complexity of the Boolean convolution and was published in 1983. The most recent citation comes from a 2023 study titled Improving $$3N$$ Circuit Complexity Lower Bounds. This article reached its peak citation in 2018, with 4 citations. It has been cited in 19 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 9 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year