Search results
- 1.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/0320071File Download Size Commentary Version Access Thapen.pdf 3 499.7 KB Publisher’s postprint open-access - 2.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/0291518File Download Size Commentary Version Access Thapen1.pdf 1 310.7 KB Publisher’s postprint require - 3.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/0256726File Download Size Commentary Version Access Thapen.pdf 1 694.7 KB Publisher’s postprint require - 4.0174630 - MU-W 980025 RIV CH eng J - Journal Article
Buss, S. - Impagliazzo, R. - Krajíček, Jan - Pudlák, Pavel - Razborov, A. A. - Sgall, Jiří
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting.
Computational Complexity. Roč. 6, č. 3 (1997), s. 256-298. ISSN 1016-3328. E-ISSN 1420-8954
Permanent Link: http://hdl.handle.net/11104/0071633File Download Size Commentary Version Access Pudlak.pdf 1 389.3 KB Author’s postprint open-access