×

Found 8 Documents (Results 1–8)

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

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
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Main Field