From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

On Isoperimetric Profiles and Computational Complexity.

P. Hrubes, и A. Yehudayoff. ICALP, том 55 из LIPIcs, стр. 89:1-89:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lower bounds for modal logics.P. Hrubes. J. Symb. Log., 72 (3): 941-958 (2007)Circuits with Medium Fan-In.P. Hrubes, и A. Rao. Electron. Colloquium Comput. Complex., (2014)Non-commutative arithmetic circuits with division.P. Hrubes, и A. Wigderson. ITCS, стр. 49-66. ACM, (2014)Random Formulas, Monotone Circuits, and Interpolation.P. Hrubes, и P. Pudlák. FOCS, стр. 121-131. IEEE Computer Society, (2017)A subquadratic upper bound on sum-of-squares compostion formulas.P. Hrubes. Electron. Colloquium Comput. Complex., (2024)On Families of Anticommuting Matrices.P. Hrubes. FLAP, 4 (10): 3261-3276 (2017)Emission load estimation and modeling in relation to the real input traffic data.P. Hrubes, и P. Derbek. EATIS, стр. 14. (2009)Timed Sets, Functional Complexity, and Computability.J. Cockett, J. Díaz-Boïls, J. Gallagher, и P. Hrubes. MFPS, том 286 из Electronic Notes in Theoretical Computer Science, стр. 117-137. Elsevier, (2012)On Isoperimetric Profiles and Computational Complexity.P. Hrubes, и A. Yehudayoff. ICALP, том 55 из LIPIcs, стр. 89:1-89:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.P. Hrubes, S. Ramamoorthy, A. Rao, и A. Yehudayoff. ICALP, том 132 из LIPIcs, стр. 72:1-72:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)