Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth. (English) Zbl 1433.68141
MSC:
68Q06
Found 4 Documents (Results 1–4)
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).
Bounds for semi-disjoint bilinear forms in a unit-cost computational model. (English) Zbl 1460.68045
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. Lect. Notes Comput. Sci. 10185, 412-424 (2017).
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution. (English) Zbl 1462.94078
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. Lect. Notes Comput. Sci. 10185, 401-411 (2017).
Filter Results by …
Document Type
- Journal Articles (1)
- Collection Articles (3)
Author
- Lingas, Andrzej (4)
- Persson, Mia (1)
- Sledneu, Dzmitry (1)
