Search results

Records found: 21  
Your query: Author Sysno/Doc.kind = "^cav_un_auth 0246710 zj^"
    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
     
     
    2.
    0542699 - MÚ 2022 RIV DE eng J - Journal Article
    Buss, S. - Thapen, Neil
    DRAT and propagation redundancy proofs without new variables.
    Logical Methods in Computer Science. Roč. 17, č. 2 (2021), č. článku 12. ISSN 1860-5974. E-ISSN 1860-5974
    R&D Projects: GA ČR(CZ) GA19-05497S
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : DRAT * extension * pigeonhole principle * proof logging
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.591, year: 2021
    Method of publishing: Open access
    https://dx.doi.org/10.23638/LMCS-17(2:12)2021
    Permanent Link: http://hdl.handle.net/11104/0320071
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf3499.7 KBPublisher’s postprintopen-access
     
     
    3.
    0504571 - MÚ 2020 RIV CH eng J - Journal Article
    Pudlák, Pavel - Thapen, Neil
    Random resolution refutations.
    Computational Complexity. Roč. 28, č. 2 (2019), s. 185-239. ISSN 1016-3328. E-ISSN 1420-8954
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : probabilistic proof * proof complexity * resolutions * witching lemma
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.850, year: 2019
    Method of publishing: Limited access
    http://dx.doi.org/10.1007/s00037-019-00182-7
    Permanent Link: http://hdl.handle.net/11104/0296173
    FileDownloadSizeCommentaryVersionAccess
    Pudlak.pdf1567.4 KBPublisher’s postprintrequire
     
     
    4.
    0499289 - MÚ 2020 RIV NL eng J - Journal Article
    Beckmann, A. - Buss, S. - Friedman, S.-D. - Müller, M. - Thapen, Neil
    Feasible set functions have small circuits.
    Computability. Roč. 8, č. 1 (2019), s. 67-98. ISSN 2211-3568
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : computational complexity * primitive recursive set functions * circuit complexity * Cobham recursive set functions
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Method of publishing: Limited access
    http://dx.doi.org/10.3233/COM-180096
    Permanent Link: http://hdl.handle.net/11104/0291518
    FileDownloadSizeCommentaryVersionAccess
    Thapen1.pdf1310.7 KBPublisher’s postprintrequire
     
     
    5.
    0489225 - MÚ 2019 RIV NL eng J - Journal Article
    Lauria, M. - Thapen, Neil
    On semantic cutting planes with very small coefficients.
    Information Processing Letters. Roč. 136, August (2018), s. 70-75. ISSN 0020-0190. E-ISSN 1872-6119
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : theory of computation * proof complexity * cutting planes
    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
    https://www.sciencedirect.com/science/article/pii/S0020019018300875
    Permanent Link: http://hdl.handle.net/11104/0283676
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf2301.5 KBPublisher’s postprintrequire
     
     
    6.
    0474390 - MÚ 2018 RIV HU eng J - Journal Article
    Lauria, M. - Pudlák, Pavel - Rödl, V. - Thapen, Neil
    The complexity of proving that a graph is Ramsey.
    Combinatorica. Roč. 37, č. 2 (2017), s. 253-268. ISSN 0209-9683. E-ISSN 1439-6912
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : complexity * c-Ramsey graphs
    OECD category: Pure mathematics
    Impact factor: 1.406, year: 2017
    http://link.springer.com/article/10.1007%2Fs00493-015-3193-9
    Permanent Link: http://hdl.handle.net/11104/0271451
    FileDownloadSizeCommentaryVersionAccess
    Pudlak1.pdf7433.6 KBPublisher’s postprintrequire
     
     
    7.
    0466751 - MÚ 2017 RIV US eng J - Journal Article
    Bonacina, I. - Galesi, N. - Thapen, Neil
    Total space in resolution.
    Siam Journal on Computing. Roč. 45, č. 5 (2016), s. 1894-1909. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA ČR GBP202/12/G061
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : total space * resolution random CNFs * proof complexity
    Subject RIV: BA - General Mathematics
    Impact factor: 1.433, year: 2016
    http://epubs.siam.org/doi/10.1137/15M1023269
    Permanent Link: http://hdl.handle.net/11104/0264987
    FileDownloadSizeCommentaryVersionAccess
    Thapen2.pdf8493.9 KBPublisher’s postprintrequire
     
     
    8.
    0462811 - MÚ 2017 RIV US eng J - Journal Article
    Thapen, Neil
    A tradeoff between length and width in resolution.
    Theory of Computing. Roč. 12, č. 5 (2016), s. 1-14. ISSN 1557-2862. E-ISSN 1557-2862
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : proof complexity * resolution * trade-off
    OECD category: Pure mathematics
    http://toc.nada.kth.se/articles/v012a005/index.html
    Permanent Link: http://hdl.handle.net/11104/0262196
    FileDownloadSizeCommentaryVersionAccess
    Thapen1.pdf2238.6 KBPublisher’s postprintopen-access
     
     
    9.
    0456152 - MÚ 2017 RIV NL eng J - Journal Article
    Beckmann, A. - Buss, S. - Friedman, S.-D. - Müller, M. - Thapen, Neil
    Cobham recursive set functions.
    Annals of Pure and Applied Logic. Roč. 167, č. 3 (2016), s. 335-369. ISSN 0168-0072. E-ISSN 1873-2461
    R&D Projects: GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : set function * polynomial time * Cobham recursion
    Subject RIV: BA - General Mathematics
    Impact factor: 0.647, year: 2016
    http://www.sciencedirect.com/science/article/pii/S0168007215001293
    Permanent Link: http://hdl.handle.net/11104/0256726
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf1694.7 KBPublisher’s postprintrequire
     
     
    10.
    0447629 - MÚ 2016 RIV US eng J - Journal Article
    Filmus, Y. - Lauria, M. - Nordström, J. - Ron-Zewi, N. - Thapen, Neil
    Space complexity in polynomial calculus.
    Siam Journal on Computing. Roč. 44, č. 4 (2015), s. 1119-1153. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
    Institutional support: RVO:67985840
    Keywords : proof complexity * polynomial calculus * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.841, year: 2015
    http://epubs.siam.org/doi/10.1137/120895950
    Permanent Link: http://hdl.handle.net/11104/0249428
    FileDownloadSizeCommentaryVersionAccess
    Thapen.pdf2439.5 KBPublisher’s postprintrequire
     
     

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

Accept allSettingsReject all