New upper bounds on the Boolean circuit complexity of symmetric functions
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2010/03/01
-
Journal
-
Indian UGC (journal)
-
Refrences7
-
Citations11
-
E. Demenkov
-
A. Kojevnikov
-
A. Kulikov
-
G. Yaroslavtsev
Cite
Demenkov, E., et al. “New Upper Bounds on the Boolean Circuit Complexity of Symmetric Functions”. Information Processing Letters, vol. 110, no. 7, 2010, pp. 264-7, https://doi.org/10.1016/j.ipl.2010.01.007.
Demenkov, E., Kojevnikov, A., Kulikov, A., & Yaroslavtsev, G. (2010). New upper bounds on the Boolean circuit complexity of symmetric functions. Information Processing Letters, 110(7), 264-267. https://doi.org/10.1016/j.ipl.2010.01.007
Demenkov, E., A. Kojevnikov, A. Kulikov, and G. Yaroslavtsev. “New Upper Bounds on the Boolean Circuit Complexity of Symmetric Functions”. Information Processing Letters 110, no. 7 (2010): 264-67. https://doi.org/10.1016/j.ipl.2010.01.007.
Demenkov E, Kojevnikov A, Kulikov A, Yaroslavtsev G. New upper bounds on the Boolean circuit complexity of symmetric functions. Information Processing Letters. 2010;110(7):264-7.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Telecommunication
Technology
Technology (General)
Industrial engineering
Management engineering
Information technology
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions | SIAM Journal on Computing |
| 7 | 1991 |
| A Boolean function requiring 3n network size | Theoretical Computer Science |
| 38 | 1984 |
| On the combinational complexity of certain symmetric Boolean functions | Mathematical Systems Theory | 1977 | ||
| The Synthesis of Two-Terminal Switching Circuits | The Bell System Technical Journal | 255 | 1949 | |
| Finding efficient circuits using SAT-solvers | 2009 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 2
is the most frequently represented among the references in this article. It primarily includes studies from Theoretical Computer Science and Mathematical Systems Theory. 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 |
|---|---|---|---|---|
| CNF Encodings of Symmetric Functions | Theory of Computing Systems |
| 2024 | |
On the complexity of monotone circuits for threshold symmetric Boolean functions | Discrete Mathematics and Applications |
| 2021 | |
On the complexity of monotone circuits for threshold symmetric Boolean functions | Diskretnaya Matematika | 2020 | ||
| On the limits of gate elimination | Journal of Computer and System Sciences |
| 2018 | |
| An iterative structure for synthesizing symmetric functions using quantum-dot cellular automata | Microprocessors and Microsystems |
| 2 | 2017 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 5
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Upper bounds on the depth of symmetric Boolean functions and was published in 2013. The most recent citation comes from a 2024 study titled CNF Encodings of Symmetric Functions. This article reached its peak citation in 2014, with 3 citations. It has been cited in 11 different journals. Among related journals, the Theory of Computing Systems cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.