×

zbMATH — the first resource for mathematics

Found 1,159 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Sasamal, Trailokya Nath; Singh, Ashutosh Kumar; Mohan, Anand
Quantum-dot cellular automata based digital logic circuits: a design perspective. (English) Zbl 1448.68013
Studies in Computational Intelligence 879. Singapore: Springer (ISBN 978-981-15-1822-5/hbk; 978-981-15-1823-2/ebook). xiv, 178 p. (2020).
MSC:  68-01 68Q06 68Q07 68Q09 68Q80 81P68 81Q37
PDF BibTeX XML Cite
\textit{T. N. Sasamal} et al., Quantum-dot cellular automata based digital logic circuits: a design perspective. Singapore: Springer (2020; Zbl 1448.68013)
Full Text: DOI
Lozhkin, S. A.; Dovgalyuk, E. L.
Depth of schemes embedded in a unit cube and implementing typical Boolean functions. (English. Russian original) Zbl 07214068
Mosc. Univ. Comput. Math. Cybern. 43, No. 4, 177-180 (2019); translation from Vestn. Mosk. Univ., Ser. XV 2019, No. 4, 33-36 (2019).
MSC:  94C 68Q06
PDF BibTeX XML Cite
\textit{S. A. Lozhkin} and \textit{E. L. Dovgalyuk}, Mosc. Univ. Comput. Math. Cybern. 43, No. 4, 177--180 (2019; Zbl 07214068); translation from Vestn. Mosk. Univ., Ser. XV 2019, No. 4, 33--36 (2019)
Full Text: DOI
Rotaru, Dragos; Wood, Tim
MArBLed circuits: mixing arithmetic and Boolean circuits with active security. (English) Zbl 1453.68082
Hao, Feng (ed.) et al., Progress in cryptology – INDOCRYPT 2019. 20th international conference on cryptology in India, Hyderabad, India, December 15–18, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11898, 227-249 (2019).
MSC:  68Q10 68Q06 94A60 94A62
PDF BibTeX XML Cite
\textit{D. Rotaru} and \textit{T. Wood}, Lect. Notes Comput. Sci. 11898, 227--249 (2019; Zbl 1453.68082)
Full Text: DOI
McKay, Dylan M.; Murray, Cody D.; Williams, R. Ryan
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. (English) Zbl 1434.68160
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215-1225 (2019).
MSC:  68Q06 68P30 68Q15 68Q17 68Q30 68W27
PDF BibTeX XML Cite
\textit{D. M. McKay} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215--1225 (2019; Zbl 1434.68160)
Full Text: DOI
Shpilka, Amir
Sylvester-Gallai type theorems for quadratic polynomials. (English) Zbl 1434.68162
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1203-1214 (2019).
MSC:  68Q06 68U05 68W20 68W30
PDF BibTeX XML Cite
\textit{A. Shpilka}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1203--1214 (2019; Zbl 1434.68162)
Full Text: DOI
Dvir, Zeev; Golovnev, Alexander; Weinstein, Omri
Static data structure lower bounds imply rigidity. (English) Zbl 1433.68102
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 967-978 (2019).
MSC:  68P05 05B20 68P30 68Q06 68Q17
PDF BibTeX XML Cite
\textit{Z. Dvir} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 967--978 (2019; Zbl 1433.68102)
Full Text: DOI
Watts, Adam Bene; Kothari, Robin; Schaeffer, Luke; Tal, Avishay
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. (English) Zbl 1434.68179
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 515-526 (2019).
MSC:  68Q12 68Q06
PDF BibTeX XML Cite
\textit{A. B. Watts} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 515--526 (2019; Zbl 1434.68179)
Full Text: DOI
Lovett, Shachar; Zhang, Jiapeng
DNF sparsification beyond sunflowers. (English) Zbl 1433.68176
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 454-460 (2019).
MSC:  68Q25 05D05 68Q06
PDF BibTeX XML Cite
\textit{S. Lovett} and \textit{J. Zhang}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 454--460 (2019; Zbl 1433.68176)
Full Text: DOI
Limaye, Nutan; Sreenivasaiah, Karteek; Srinivasan, Srikanth; Tripathi, Utkarsh; Venkitesh, S.
A fixed-depth size-hierarchy theorem for \(\mathrm{AC}^0[\oplus]\) via the coin problem. (English) Zbl 1433.68140
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 442-453 (2019).
MSC:  68Q06 68Q15
PDF BibTeX XML Cite
\textit{N. Limaye} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 442--453 (2019; Zbl 1433.68140)
Full Text: DOI
Kayal, Neeraj; Saha, Chandan
Reconstruction of non-degenerate homogeneous depth three circuits. (English) Zbl 1433.68139
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 413-424 (2019).
MSC:  68Q06
PDF BibTeX XML Cite
\textit{N. Kayal} and \textit{C. Saha}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 413--424 (2019; Zbl 1433.68139)
Full Text: DOI
Sherstov, Alexander A.; Wu, Pei
Near-optimal lower bounds on the threshold degree and sign-rank of \(\mathrm{AC}^0\). (English) Zbl 1433.68153
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 401-412 (2019).
MSC:  68Q15 68Q06 68Q11 68Q17
PDF BibTeX XML Cite
\textit{A. A. Sherstov} and \textit{P. Wu}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 401--412 (2019; Zbl 1433.68153)
Full Text: DOI
Chen, Lijie; Tell, Roei
Bootstrapping results for threshold circuits “just beyond” known lower bounds. (English) Zbl 1433.68137
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 34-41 (2019).
MSC:  68Q06 68Q17
PDF BibTeX XML Cite
\textit{L. Chen} and \textit{R. Tell}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 34--41 (2019; Zbl 1433.68137)
Full Text: DOI
Raz, Ran; Tal, Avishay
Oracle separation of BQP and PH. (English) Zbl 1433.68152
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 13-23 (2019).
MSC:  68Q15 68Q06 68Q12
PDF BibTeX XML Cite
\textit{R. Raz} and \textit{A. Tal}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 13--23 (2019; Zbl 1433.68152)
Full Text: DOI
Neri, Ferrante
Linear algebra for computational sciences and engineering. With a foreword by Alberto Grasso. 2nd edition. (English) Zbl 1442.15001
Cham: Springer (ISBN 978-3-030-21320-6/hbk; 978-3-030-21321-3/ebook). xxv, 574 p. (2019).
Reviewer: Ctirad Matonoha (Praha)
MSC:  15-01 15Axx 65Fxx 65Y20 00A06 05C05 05C50 94C15
PDF BibTeX XML Cite
\textit{F. Neri}, Linear algebra for computational sciences and engineering. With a foreword by Alberto Grasso. 2nd edition. Cham: Springer (2019; Zbl 1442.15001)
Full Text: DOI
Durand, Arnaud; Haak, Anselm; Vollmer, Heribert
Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth. (English) Zbl 07298760
Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-5583-4). 354-363 (2018).
MSC:  68Q19 03C13
PDF BibTeX XML Cite
\textit{A. Durand} et al., in: Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9--12, 2018. New York, NY: Association for Computing Machinery (ACM). 354--363 (2018; Zbl 07298760)
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
Fleischer, Lukas
On the complexity of the Cayley semigroup membership problem. (English) Zbl 1441.68090
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 25, 12 p. (2018).
MSC:  68Q25 20F10 20M05 20M07 20M14 68Q15
PDF BibTeX XML Cite
\textit{L. Fleischer}, LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 25, 12 p. (2018; Zbl 1441.68090)
Full Text: DOI
Bouland, Adam; Fitzsimons, Joseph F.; Koh, Dax Enshan
Complexity classification of conjugated Clifford circuits. (English) Zbl 1441.81054
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 21, 25 p. (2018).
MSC:  81P68 68Q06 68Q12 68Q17
PDF BibTeX XML Cite
\textit{A. Bouland} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 21, 25 p. (2018; Zbl 1441.81054)
Full Text: DOI
Chou, Chi-Ning; Kumar, Mrinal; Solomon, Noam
Hardness vs randomness for bounded depth arithmetic circuits. (English) Zbl 1441.68040
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 13, 17 p. (2018).
MSC:  68Q06 68Q17 68W20
PDF BibTeX XML Cite
\textit{C.-N. Chou} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 13, 17 p. (2018; Zbl 1441.68040)
Full Text: DOI
Carmosino, Marco L.; Impagliazzo, Russell; Lovett, Shachar; Mihajlin, Ivan
Hardness amplification for non-commutative arithmetic circuits. (English) Zbl 1441.68039
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 12, 16 p. (2018).
MSC:  68Q06 68Q17
PDF BibTeX XML Cite
\textit{M. L. Carmosino} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 12, 16 p. (2018; Zbl 1441.68039)
Full Text: DOI
Alon, Noga; Kumar, Mrinal; Volk, Ben Lee
Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits. (English) Zbl 1441.68038
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 11, 16 p. (2018).
MSC:  68Q06 05D05 68Q17
PDF BibTeX XML Cite
\textit{N. Alon} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 11, 16 p. (2018; Zbl 1441.68038)
Full Text: DOI
Impagliazzo, Russell; Kabanets, Valentine; Volkovich, Ilya
The power of natural properties as oracles. (English) Zbl 1441.68060
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 7, 20 p. (2018).
MSC:  68Q15 68Q06 68Q17 68W20
PDF BibTeX XML Cite
\textit{R. Impagliazzo} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 7, 20 p. (2018; Zbl 1441.68060)
Full Text: DOI
Williams, Richard Ryan
Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials. (English) Zbl 1441.68047
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 6, 24 p. (2018).
MSC:  68Q06 68Q17
PDF BibTeX XML Cite
\textit{R. R. Williams}, LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 6, 24 p. (2018; Zbl 1441.68047)
Full Text: DOI
Hirahara, Shuichi; Oliveira, Igor C.; Santhanam, Rahul
NP-hardness of minimum circuit size problem for OR-AND-MOD circuits. (English) Zbl 1441.68074
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 5, 31 p. (2018).
MSC:  68Q17 68Q06
PDF BibTeX XML Cite
\textit{S. Hirahara} et al., LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 5, 31 p. (2018; Zbl 1441.68074)
Full Text: DOI
Kane, Daniel; Rao, Sankeerth
A PRG for Boolean PTF of degree 2 with seed length subpolynomial in \(\epsilon\) and logarithmic in \(n\). (English) Zbl 1441.68151
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 2, 24 p. (2018).
MSC:  68Q87 68Q06
PDF BibTeX XML Cite
\textit{D. Kane} and \textit{S. Rao}, LIPIcs -- Leibniz Int. Proc. Inform. 102, Article 2, 24 p. (2018; Zbl 1441.68151)
Full Text: DOI
Safoev, Nuriddin; Jeon, Jun-Cheol
Compact RCA based on multilayer quantum-dot cellular automata. (English) Zbl 1455.68057
Bhateja, Vikrant (ed.) et al., Information systems design and intelligent applications. Proceedings of fourth international conference INDIA 2017, Da Nang, Vietnam, June 15–17, 2017. Singapore: Springer. Adv. Intell. Syst. Comput. 627, 515-524 (2018).
MSC:  68Q06 68Q80 81P65
PDF BibTeX XML Cite
\textit{N. Safoev} and \textit{J.-C. Jeon}, Adv. Intell. Syst. Comput. 627, 515--524 (2018; Zbl 1455.68057)
Full Text: DOI
Pitassi, Toniann; Robere, Robert
Lifting Nullstellensatz to monotone span programs over any field. (English) Zbl 1428.68152
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). 1207-1219 (2018).
MSC:  68Q06 12-08 68Q17 94A62
PDF BibTeX XML Cite
\textit{T. Pitassi} and \textit{R. Robere}, 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). 1207--1219 (2018; Zbl 1428.68152)
Full Text: DOI
Forbes, Michael A.; Shpilka, Amir
A PSPACE construction of a hitting set for the closure of small algebraic circuits. (English) Zbl 1428.68171
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). 1180-1192 (2018).
MSC:  68Q25 68Q06
PDF BibTeX XML Cite
\textit{M. A. Forbes} and \textit{A. Shpilka}, 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). 1180--1192 (2018; Zbl 1428.68171)
Full Text: DOI arXiv
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
Garg, Ankit; Göös, Mika; Kamath, Pritish; Sokolov, Dmitry
Monotone circuit lower bounds from resolution. (English) Zbl 1428.68151
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). 902-911 (2018).
MSC:  68Q06 03F20 68Q17
PDF BibTeX XML Cite
\textit{A. Garg} 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). 902--911 (2018; Zbl 1428.68151)
Full Text: DOI
Murray, Cody; Williams, Ryan
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP. (English) Zbl 1428.68172
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). 890-901 (2018).
MSC:  68Q25 68Q06 68Q15 68Q17
PDF BibTeX XML Cite
\textit{C. Murray} and \textit{R. Williams}, 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). 890--901 (2018; Zbl 1428.68172)
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
Tell, Roei
Quantified derandomization of linear threshold circuits. (English) Zbl 1428.68169
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). 855-865 (2018).
MSC:  68Q17 68Q06 68Q15 68W20
PDF BibTeX XML Cite
\textit{R. Tell}, 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). 855--865 (2018; Zbl 1428.68169)
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
all top 3
Software