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
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