×

zbMATH — the first resource for mathematics

Found 966 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Beyersdorff, Olaf; Blinkhorn, Joshua; Mahajan, Meena
Hardness characterisations and size-width lower bounds for QBF resolution. (English) Zbl 07299470
Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 209-223 (2020).
MSC:  03F20
PDF BibTeX XML Cite
\textit{O. Beyersdorff} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 209--223 (2020; Zbl 07299470)
Full Text: DOI
Alekhina, M. A.; Grabovskaya, S. M.; Gusynina, Yu. S.
Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type 0 at the element outputs. (Russian. English summary) Zbl 07311667
Prikl. Diskretn. Mat. 2019, No. 45, 44-54 (2019).
MSC:  94C 62
PDF BibTeX XML Cite
\textit{M. A. Alekhina} et al., Prikl. Diskretn. Mat. 2019, No. 45, 44--54 (2019; Zbl 07311667)
Full Text: DOI MNR
Sun, Xiaoming; Sun, Yuan; Wu, Kewen; Xia, Zhiyu
On the relationship between energy complexity and other Boolean function measures. (English) Zbl 07172866
Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26175-7/pbk; 978-3-030-26176-4/ebook). Lecture Notes in Computer Science 11653, 516-528 (2019).
MSC:  68Rxx
PDF BibTeX XML Cite
\textit{X. Sun} et al., Lect. Notes Comput. Sci. 11653, 516--528 (2019; Zbl 07172866)
Full Text: DOI
Alekhina, M. A.; Gusynina, Yu. S.; Shornikova, T. A.
About reliability of circuits with faults of type 0 at the outputs of elements in a full finite basis containing a special function. (English. Russian original) Zbl 1430.94117
Russ. Math. 63, No. 6, 79-81 (2019); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 6, 85-88 (2019).
MSC:  94C12 68M15 94C05 94D10
PDF BibTeX XML Cite
\textit{M. A. Alekhina} et al., Russ. Math. 63, No. 6, 79--81 (2019; Zbl 1430.94117); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2019, No. 6, 85--88 (2019)
Full Text: DOI
Romanov, Dmitry S.; Romanova, Elena Yu.
A method of synthesis of irredundant circuits admitting single fault detection tests of constant length. (English. Russian original) Zbl 1454.94146
Discrete Math. Appl. 29, No. 1, 35-48 (2019); translation from Diskretn. Mat. 29, No. 4, 87-105 (2017).
MSC:  94C05 94C11 94C12
PDF BibTeX XML Cite
\textit{D. S. Romanov} and \textit{E. Yu. Romanova}, Discrete Math. Appl. 29, No. 1, 35--48 (2019; Zbl 1454.94146); translation from Diskretn. Mat. 29, No. 4, 87--105 (2017)
Full Text: DOI
Lingas, Andrzej
Small normalized Boolean circuits for semi-disjoint bilinear forms require logarithmic conjunction-depth. (English) Zbl 1441.68042
Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 26, 10 p. (2018).
MSC:  68Q06 68Q17
PDF BibTeX XML Cite
\textit{A. Lingas}, LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 26, 10 p. (2018; Zbl 1441.68042)
Full Text: DOI
Agrawal, Manindra; Ghosh, Sumanta; Saxena, Nitin
Bootstrapping variables in algebraic circuits. (English) Zbl 1427.68356
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166-1179 (2018).
MSC:  68W20 68Q17 68Q25 94C11
PDF BibTeX XML Cite
\textit{M. Agrawal} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 1166--1179 (2018; Zbl 1427.68356)
Full Text: DOI
Ikenmeyer, Christian; Komarath, Balagopal; Lenzen, Christoph; Lysikov, Vladimir; Mokhov, Andrey; Sreenivasaiah, Karteek
On the complexity of hazard-free circuits. (English) Zbl 1428.94117
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 878-889 (2018).
MSC:  94C11 68Q06 68Q25
PDF BibTeX XML Cite
\textit{C. Ikenmeyer} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 878--889 (2018; Zbl 1428.94117)
Full Text: DOI
Kochergin, V. V.; Mikhaĭlovich, A. V.
On the complexity of multivalued logic functions over some infinite basis. (Russian, English) Zbl 1413.94079
Diskretn. Anal. Issled. Oper. 25, No. 1, 42-74 (2018); translation in J. Appl. Ind. Math. 12, No. 1, 40-58 (2018).
MSC:  94C10
PDF BibTeX XML Cite
\textit{V. V. Kochergin} and \textit{A. V. Mikhaĭlovich}, Diskretn. Anal. Issled. Oper. 25, No. 1, 42--74 (2018; Zbl 1413.94079); translation in J. Appl. Ind. Math. 12, No. 1, 40--58 (2018)
Full Text: DOI
De Vos, Alexis; De Baerdemacker, Stijn; Van Rentergem, Yvan
Synthesis of quantum circuits vs. synthesis of classical reversible circuits. (English) Zbl 1405.81006
Synthesis Lectures on Digital Circuits and Systems 54. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-68173-379-1/pbk; 978-1-68173-381-4/hbk; 978-1-68173-380-7/ebook). xv, 109 p. (2018).
Reviewer: Liviu Goraş (Iaşi)
MSC:  81-02 94-02 81P68 94C10
PDF BibTeX XML Cite
\textit{A. De Vos} et al., Synthesis of quantum circuits vs. synthesis of classical reversible circuits. San Rafael, CA: Morgan \& Claypool Publishers (2018; Zbl 1405.81006)
Full Text: DOI
Impagliazzo, Russell; Kabanets, Valentine; Kolokolova, Antonina; McKenzie, Pierre; Romani, Shadab
Does looking inside a circuit help? (English) Zbl 1440.68079
Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 1, 13 p. (2017).
MSC:  68Q06 68R07 94C11
PDF BibTeX XML Cite
\textit{R. Impagliazzo} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 1, 13 p. (2017; Zbl 1440.68079)
Full Text: DOI
Oliveira, Igor C.; Santhanam, Rahul
Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomness. (English) Zbl 1440.68083
O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 18, 49 p. (2017).
MSC:  68Q06 68Q15 68Q17 68Q32 68Q87
PDF BibTeX XML Cite
\textit{I. C. Oliveira} and \textit{R. Santhanam}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 18, 49 p. (2017; Zbl 1440.68083)
Full Text: DOI
Tal, Avishay
Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\). (English) Zbl 1440.68084
O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 15, 31 p. (2017).
MSC:  68Q06 68Q15 94C11
PDF BibTeX XML Cite
\textit{A. Tal}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 15, 31 p. (2017; Zbl 1440.68084)
Full Text: DOI
Servedio, Rocco A.; Tan, Li-Yang
What circuit classes can be learned with non-trivial savings? (English) Zbl 1402.68112
Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 30, 21 p. (2017).
MSC:  68Q32 94C10
PDF BibTeX XML Cite
\textit{R. A. Servedio} and \textit{L.-Y. Tan}, LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 30, 21 p. (2017; Zbl 1402.68112)
Full Text: DOI
Aaronson, Scott; Grier, Daniel; Schaeffer, Luke
The classification of reversible bit operations. (English) Zbl 1404.68042
Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 23, 34 p. (2017).
MSC:  68Q05 81P68 94C10
PDF BibTeX XML Cite
\textit{S. Aaronson} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 23, 34 p. (2017; Zbl 1404.68042)
Full Text: DOI
Kochergin, Vadim V.; Mikhaĭlovich, Anna V.
The minimum number of negations in circuits for systems of multi-valued functions. (English. Russian original) Zbl 1441.94117
Discrete Math. Appl. 27, No. 5, 295-302 (2017); translation from Diskretn. Mat. 28, No. 4, 80-90 (2016).
MSC:  94C11 03B50
PDF BibTeX XML Cite
\textit{V. V. Kochergin} and \textit{A. V. Mikhaĭlovich}, Discrete Math. Appl. 27, No. 5, 295--302 (2017; Zbl 1441.94117); translation from Diskretn. Mat. 28, No. 4, 80--90 (2016)
Full Text: DOI
Kulikov, Alexander S.; Podolskii, Vladimir V.
Computing majority by constant depth majority circuits with low fan-in gates. (English) Zbl 1402.68100
Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 49, 14 p. (2017).
MSC:  68Q25 68Q10 68Q17 68W20 94C10
PDF BibTeX XML Cite
\textit{A. S. Kulikov} and \textit{V. V. Podolskii}, LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 49, 14 p. (2017; Zbl 1402.68100)
Full Text: DOI
Chistikov, Dmitry; Iván, Szabolcs; Lubiw, Anna; Shallit, Jeffrey
Fractional coverings, greedy coverings, and rectifier networks. (English) Zbl 1402.68086
Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 23, 14 p. (2017).
MSC:  68Q25 15B34 68Q17 68R10
PDF BibTeX XML Cite
\textit{D. Chistikov} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 23, 14 p. (2017; Zbl 1402.68086)
Full Text: DOI
Kole, Abhoy; Wille, Robert; Datta, Kamalika; Sengupta, Indranil
Test pattern generation effort evaluation of reversible circuits. (English) Zbl 06850921
Phillips, Iain (ed.) et al., Reversible computation. 9th international conference, RC 2017, Kolkata, India, July 6–7, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-59935-9/pbk; 978-3-319-59936-6/ebook). Lecture Notes in Computer Science 10301, 162-175 (2017).
MSC:  68Q05 68Q10 81P68 94C10
PDF BibTeX XML Cite
\textit{A. Kole} et al., Lect. Notes Comput. Sci. 10301, 162--175 (2017; Zbl 06850921)
Full Text: DOI
Chen, Xi; Oliveira, Igor C.; Servedio, Rocco A.
Addition is exponentially harder than counting for shallow monotone circuits. (English) Zbl 1370.94608
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 1232-1245 (2017).
MSC:  94C10 68Q25
PDF BibTeX XML Cite
\textit{X. Chen} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 1232--1245 (2017; Zbl 1370.94608)
Full Text: DOI arXiv
Alman, Josh; Williams, Ryan
Probabilistic rank and matrix rigidity. (English) Zbl 1369.68212
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 641-652 (2017).
MSC:  68Q17 15A03 15B34 65T50 68Q05 94C10
PDF BibTeX XML Cite
\textit{J. Alman} and \textit{R. Williams}, in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 641--652 (2017; Zbl 1369.68212)
Full Text: DOI
Kabanets, Valentine; Kane, Daniel M.; Lu, Zhenjian
A polynomial restriction lemma with applications. (English) Zbl 1370.68223
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 615-628 (2017).
MSC:  68Q87 68Q10 68Q17 94C10
PDF BibTeX XML Cite
\textit{V. Kabanets} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 615--628 (2017; Zbl 1370.68223)
Full Text: DOI
Nahin, Paul J.
The logician and the engineer. How George Boole and Claude Shannon created the information age. Reprint of the 2013 hardback edition. (English) Zbl 1366.94003
Princeton, NJ: Princeton University Press (ISBN 978-0-691-17600-0/pbk; 978-1-4008-4465-4/ebook). xii, 228 p. (2017).
MSC:  94-03 01A55 01A60 01A70 94-01 94A15 94A17 94A24 94C10
PDF BibTeX XML Cite
\textit{P. J. Nahin}, The logician and the engineer. How George Boole and Claude Shannon created the information age. Reprint of the 2013 hardback edition. Princeton, NJ: Princeton University Press (2017; Zbl 1366.94003)
Full Text: DOI
Lingas, Andrzej
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution. (English) Zbl 06721533
Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-55910-0/pbk; 978-3-319-55911-7/ebook). Lecture Notes in Computer Science 10185, 401-411 (2017).
MSC:  68Q05
PDF BibTeX XML Cite
\textit{A. Lingas}, Lect. Notes Comput. Sci. 10185, 401--411 (2017; Zbl 06721533)
Full Text: DOI
Salibra, Antonino; Manzonetto, Giulio; Favro, Giordano
Factor varieties and symbolic computation. (English) Zbl 1394.03019
Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 739-748 (2016).
MSC:  03B35 03B05 03B10 03B50 03G25 08B05 68Q42 94C10
PDF BibTeX XML Cite
\textit{A. Salibra} et al., in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 739--748 (2016; Zbl 1394.03019)
Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1398.68259
Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 82, 16 p. (2016).
MSC:  68Q25 68Q17 94C10
PDF BibTeX XML Cite
\textit{T. Sakai} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 82, 16 p. (2016; Zbl 1398.68259)
Full Text: DOI
Golovnev, Alexander; Hirsch, Edward A.; Knop, Alexander; Kulikov, Alexander S.
On the limits of gate elimination. (English) Zbl 1393.68060
Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 46, 13 p. (2016).
MSC:  68Q17 68Q05 94C10
PDF BibTeX XML Cite
\textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 46, 13 p. (2016; Zbl 1393.68060)
Full Text: DOI
Golovnev, Alexander; Kulikov, Alexander S.; Smal, Alexander V.; Tamaki, Suguru
Circuit size lower bounds and #SAT upper bounds through a general framework. (English) Zbl 1398.68193
Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 45, 16 p. (2016).
MSC:  68Q17 68Q25 94C10
PDF BibTeX XML Cite
\textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 45, 16 p. (2016; Zbl 1398.68193)
Full Text: DOI
Cheraghchi, Mahdi; Grigorescu, Elena; Juba, Brendan; Wimmer, Karl; Xie, Ning
\(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product. (English) Zbl 1388.68084
Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 35, 14 p. (2016).
MSC:  68Q17
PDF BibTeX XML Cite
\textit{M. Cheraghchi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 35, 14 p. (2016; Zbl 1388.68084)
Full Text: DOI
Chen, Ruiwen; Santhanam, Rahul; Srinivasan, Srikanth
Average-case lower bounds and satisfiability algorithms for small threshold circuits. (English) Zbl 1380.68191
Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 1, 35 p. (2016).
MSC:  68Q17 68Q05 68T20 94C10
PDF BibTeX XML Cite
\textit{R. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 50, Article 1, 35 p. (2016; Zbl 1380.68191)
Full Text: DOI
Kane, Daniel M.; Williams, Ryan
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits. (English) Zbl 1373.68220
Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 633-643 (2016).
MSC:  68Q05 68Q17 94C10
PDF BibTeX XML Cite
\textit{D. M. Kane} and \textit{R. Williams}, in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 633--643 (2016; Zbl 1373.68220)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
Biographic Reference
all top 3
Software