Rossman, Benjamin Subspace-invariant \(\mathrm{AC}^0\) formulas. (English) Zbl 1442.68054 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 93, 11 p. (2017). MSC: 68Q06 68Q15 PDFBibTeX XMLCite \textit{B. Rossman}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 93, 11 p. (2017; Zbl 1442.68054) Full Text: DOI
Allender, Eric; Hirahara, Shuichi New insights on the (non-)hardness of circuit minimization and related problems. (English) Zbl 1441.68082 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 54, 14 p. (2017). MSC: 68Q25 68Q06 68Q17 68Q30 PDFBibTeX XMLCite \textit{E. Allender} and \textit{S. Hirahara}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 54, 14 p. (2017; Zbl 1441.68082) Full Text: DOI
Bringmann, Karl; Ikenmeyer, Christian; Zuiddam, Jeroen On algebraic branching programs of small width. (English) Zbl 1440.68087 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 20, 31 p. (2017). MSC: 68Q09 68Q06 68Q15 PDFBibTeX XMLCite \textit{K. Bringmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 20, 31 p. (2017; Zbl 1440.68087) Full Text: DOI
Hirahara, Shuichi; Santhanam, Rahul On the average-case complexity of MCSP and its variants. (English) Zbl 1435.68089 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 7, 20 p. (2017). MSC: 68Q06 68Q17 68Q25 68Q30 PDFBibTeX XMLCite \textit{S. Hirahara} and \textit{R. Santhanam}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 7, 20 p. (2017; Zbl 1435.68089) Full Text: DOI
Allender, Eric; Holden, Dhiraj; Kabanets, Valentine The minimum oracle circuit size problem. (English) Zbl 1408.68065 Comput. Complexity 26, No. 2, 469-496 (2017). MSC: 68Q17 68Q30 PDFBibTeX XMLCite \textit{E. Allender} et al., Comput. Complexity 26, No. 2, 469--496 (2017; Zbl 1408.68065) Full Text: DOI Link
Murray, Cody D.; Williams, R. Ryan On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity. (English) Zbl 1378.68053 Theory Comput. 13, Paper No. 4, 22 p. (2017). MSC: 68Q17 68Q15 94C10 PDFBibTeX XMLCite \textit{C. D. Murray} and \textit{R. R. Williams}, Theory Comput. 13, Paper No. 4, 22 p. (2017; Zbl 1378.68053) Full Text: DOI
Allender, Eric; Das, Bireswar Zero knowledge and circuit minimization. (English) Zbl 1376.68056 Inf. Comput. 256, 2-8 (2017). MSC: 68Q25 05C60 68Q15 94C10 PDFBibTeX XMLCite \textit{E. Allender} and \textit{B. Das}, Inf. Comput. 256, 2--8 (2017; Zbl 1376.68056) Full Text: DOI
Rudow, M. Discrete logarithm and minimum circuit size. (English) Zbl 1422.68141 Inf. Process. Lett. 128, 1-4 (2017). MSC: 68Q25 PDFBibTeX XMLCite \textit{M. Rudow}, Inf. Process. Lett. 128, 1--4 (2017; Zbl 1422.68141) Full Text: DOI