Short monotone formulae for the majority function

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
On the depth complexity of formulas 1980
10.1007/BF01366920 Mathematical Notes
  • Science: Mathematics
 1972
The complexity of the realization of symmetrical functions by formulae Matematicheskie Zametki 1972
Complexity bounds for the realization of monotone symmetrical functions by means of formulas in the basis ∧, ∨, ¬ 1969
Complexity bounds for the realization of monotone symmetrical functions by means of formulas in the basis ∧, ∨, ¬ 1970
Citations
Title Journal Journal Categories Citations Publication Date
Improved Linear Decomposition of Majority and Threshold Boolean Functions IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics
  • Technology: Engineering (General). Civil engineering (General)
 2023
Regular expression length via arithmetic formula complexity 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
 2022
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations 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
 2022
Adaptively Secure Distributed PRFs from $$\textsf {LWE}$$ 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
 2021
On the Complexity of the Clone Membership Problem Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • 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
 2021
Citations Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science42
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software33
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware31
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods22
Science: Mathematics21
Technology: Engineering (General). Civil engineering (General)9
Science: Science (General): Cybernetics: Information theory7
Technology: Technology (General): Industrial engineering. Management engineering: Information technology5
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication5
Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks4
Science: Physics3
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics3
Science: Mathematics: Probabilities. Mathematical statistics1
Philosophy. Psychology. Religion: Psychology1
Medicine: Internal medicine: Neurosciences. Biological psychiatry. Neuropsychiatry: Neurology. Diseases of the nervous system: Psychiatry1
Technology: Mechanical engineering and machinery: Renewable energy sources1
Technology: Engineering (General). Civil engineering (General): Environmental engineering1
Geography. Anthropology. Recreation: Environmental sciences1
Technology: Environmental technology. Sanitary engineering1
Science: Biology (General): Ecology1
Technology: Engineering (General). Civil engineering (General): Mechanics of engineering. Applied mechanics1
Technology: Mechanical engineering and machinery1
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 42 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Constructing $O(n\log n)$ Size Monotone Formulae for the kth Threshold Function of n Boolean Variables and was published in 1986. The most recent citation comes from a 2023 study titled Improved Linear Decomposition of Majority and Threshold Boolean Functions. This article reached its peak citation in 2016, with 6 citations. It has been cited in 37 different journals. Among related journals, the SIAM Journal on Computing cited this research the most, with 11 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year