Basket

  1. 1.
    0565597 - MÚ 2023 RIV SG eng J - Journal Article
    Kołodziejcz, L. A. - Thapen, Neil
    Approximate counting and NP search problems.
    Journal of Mathematical Logic. Roč. 22, č. 3 (2022), č. článku 2250012. ISSN 0219-0613. E-ISSN 1793-6691
    R&D Projects: GA ČR(CZ) GA19-05497S
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : approximate counting * bounded arithmetic * CPLS * NP search problems
    OECD category: Pure mathematics
    Impact factor: 0.9, year: 2022
    Method of publishing: Limited access
    https://doi.org/10.1142/S021906132250012X
    Permanent Link: https://hdl.handle.net/11104/0337115
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf2439.3 KBPublisher’s postprintrequire
     
     

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