Search results

Records found: 15  
Your query: Author Sysno/Doc.kind = "^cav_un_auth 0258893 zj^"
    1.
    0577240 - MÚ 2024 RIV IL eng J - Journal Article
    Hrubeš, Pavel - Yehudayoff, A.
    Shadows of Newton polytopes.
    Israel Journal of Mathematics. Roč. 256, č. 1 (2023), s. 311-343. ISSN 0021-2172. E-ISSN 1565-8511
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : Newton polytopes * shadow complexity
    OECD category: Pure mathematics
    Impact factor: 1, year: 2022
    Method of publishing: Limited access
    https://doi.org/10.1007/s11856-023-2510-z
    Permanent Link: https://hdl.handle.net/11104/0346450
    FileDownloadSizeCommentaryVersionAccess
    Hrubes2.pdf0434 KBPublisher’s postprintrequire
     
     
    2.
    0572825 - MÚ 2024 RIV DE eng J - Journal Article
    Hrubeš, Pavel - Talebanfard, Navid
    On the extension complexity of polytopes separating subsets of the Boolean cube.
    Discrete & Computational Geometry. Roč. 70, č. 1 (2023), s. 268-278. ISSN 0179-5376. E-ISSN 1432-0444
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : Boolean cube * extension complexity * polytopes * sign patterns
    OECD category: Pure mathematics
    Impact factor: 0.8, year: 2022
    Method of publishing: Limited access
    https://doi.org/10.1007/s00454-022-00419-3
    Permanent Link: https://hdl.handle.net/11104/0343383
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf0292.4 KBPublisher’s postprintrequire
     
     
    3.
    0534404 - MÚ 2021 RIV US eng J - Journal Article
    Hrubeš, Pavel
    On the complexity of computing a random Boolean function over the reals.
    Theory of Computing. Roč. 16, October (2020), č. článku 9. ISSN 1557-2862. E-ISSN 1557-2862
    R&D Projects: GA ČR(CZ) GA19-05497S
    Institutional support: RVO:67985840
    Keywords : random Boolean function * quantifier elimination
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 1.000, year: 2020
    Method of publishing: Open access
    https://dx.doi.org/10.4086/toc.2020.v016a009
    Permanent Link: http://hdl.handle.net/11104/0312602
    FileDownloadSizeCommentaryVersionAccess
    Hrubes2.pdf4243.8 KBPublisher’s postprintopen-access
     
     
    4.
    0531552 - MÚ 2021 RIV CH eng J - Journal Article
    Hrubeš, Pavel
    On ϵ-sensitive monotone computations.
    Computational Complexity. Roč. 29, č. 2 (2020), č. článku 6. ISSN 1016-3328. E-ISSN 1420-8954
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : arithmetic circuit complexity * extension complexity * nonnegative rank
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 1.353, year: 2020
    Method of publishing: Limited access
    https://doi.org/10.1007/s00037-020-00196-6
    Permanent Link: http://hdl.handle.net/11104/0310182
    FileDownloadSizeCommentaryVersionAccess
    Hrubes1.pdf3365.1 KBPublisher’s postprintrequire
     
     
    5.
    0524140 - MÚ 2021 RIV GB eng J - Journal Article
    Hrubeš, Pavel
    On the distribution of runners on a circle.
    European Journal of Combinatorics. Roč. 89, October (2020), č. článku 103137. ISSN 0195-6698. E-ISSN 1095-9971
    R&D Projects: GA ČR(CZ) GX19-27871X
    Institutional support: RVO:67985840
    Keywords : computational complexity * distribution of runners on a circle
    OECD category: Pure mathematics
    Impact factor: 0.847, year: 2020
    Method of publishing: Limited access
    https://doi.org/10.1016/j.ejc.2020.103137
    Permanent Link: http://hdl.handle.net/11104/0308495
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf1376.7 KBPublisher’s postprintrequire
     
     
    6.
    0502173 - MÚ 2020 GB eng J - Journal Article
    Hrubeš, Pavel
    On families of anticommuting matrices.
    Journal of Applied Logics: IfCoLog Journal of Logics and their Application. Roč. 4, č. 10 (2017), s. 3263-3277. ISSN 2055-3706. E-ISSN 2055-3714
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : anticommuting matrices * sum-of-squares formulas
    OECD category: Pure mathematics
    Method of publishing: Open access
    Permanent Link: http://hdl.handle.net/11104/0294124
    FileDownloadSizeCommentaryVersionAccess
    Hrubes1.pdf11.6 MBPublisher’s postprintrequire
     
     
    7.
    0500071 - MÚ 2020 RIV GB eng J - Journal Article
    Ben-David, S. - Hrubeš, Pavel - Shay, M. - Shpilka, A. - Yehudayoff, A.
    Learnability can be undecidable.
    Nature Machine Intelligence. Roč. 1, č. 1 (2019), s. 44-48. E-ISSN 2522-5839
    Institutional support: RVO:67985840
    Keywords : learnability * machine learning
    OECD category: Pure mathematics
    Method of publishing: Limited access
    http://dx.doi.org/10.1038/s42256-018-0002-3
    Permanent Link: http://hdl.handle.net/11104/0292219
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf111.6 MBPublisher’s postprintrequire
     
     
    8.
    0482972 - MÚ 2019 RIV NL eng J - Journal Article
    Hrubeš, Pavel - Pudlák, Pavel
    A note on monotone real circuits.
    Information Processing Letters. Roč. 131, March (2018), s. 15-19. ISSN 0020-0190. E-ISSN 1872-6119
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : computational complexity * monotone real circuit * Karchmer-Wigderson game
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.914, year: 2018
    http://www.sciencedirect.com/science/article/pii/S0020019017301965?via%3Dihub
    Permanent Link: http://hdl.handle.net/11104/0278383
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf4264.6 KBPublisher’s postprintrequire
     
     
    9.
    0469668 - MÚ 2017 RIV US eng J - Journal Article
    Hrubeš, Pavel
    On hardness of multilinearization, and VNP-completeness in characteristics 2.
    ACM Transactions on Computation Theory. Roč. 9, č. 1 (2016), č. článku 1. ISSN 1942-3454
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : boolean formula * complexity measure
    Subject RIV: BA - General Mathematics
    http://dl.acm.org/citation.cfm?doid=3007903.2940323
    Permanent Link: http://hdl.handle.net/11104/0267481
    FileDownloadSizeCommentaryVersionAccess
    Hrubes3.pdf3208.9 KBPublisher’s postprintrequire
     
     
    10.
    0457160 - MÚ 2017 RIV US eng J - Journal Article
    Hrubeš, Pavel
    On families of anticommuting matrices.
    Linear Algebra and Its Applications. Roč. 493, March 15 (2016), s. 494-507. ISSN 0024-3795. E-ISSN 1873-1856
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : anticommuting matrices * sum-of-squares formulas
    Subject RIV: BA - General Mathematics
    Impact factor: 0.973, year: 2016
    http://www.sciencedirect.com/science/article/pii/S0024379515007296
    Permanent Link: http://hdl.handle.net/11104/0257570
    FileDownloadSizeCommentaryVersionAccess
    Hrubes.pdf6356.8 KBPublisher’s postprintrequire
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.

Accept allSettingsReject all