Basket

  1. 1.
    0477098 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
    Pudlák, Pavel - Thapen, Neil
    Random resolution refutations.
    32nd Computational Complexity Conference (CCC 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (O’Donnell, R.), s. 1-10, č. článku 1. Leibniz International Proceedings in Informatics, 79. ISBN 978-3-95977-040-8. ISSN 1868-8969.
    [32nd Computational Complexity Conference (CCC 2017). Riga (LT), 06.07.2017-09.07.2017]
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : proof complexity * random * resolution * resolution
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://drops.dagstuhl.de/opus/volltexte/2017/7523
    Permanent Link: http://hdl.handle.net/11104/0273490
    FileDownloadSizeCommentaryVersionAccess
    Pudlak3.pdf3538.1 KBPublisher’s postprintrequire
     
     

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