Search results
- 1.0524146 - MÚ 2021 RIV SG eng J - Journal Article
Jeřábek, Emil
Recursive functions and existentially closed structures.
Journal of Mathematical Logic. Roč. 20, č. 1 (2020), č. článku 2050002. ISSN 0219-0613. E-ISSN 1793-6691
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : classification theory * relative interpretation * representability of recursive functions
OECD category: Pure mathematics
Impact factor: 0.840, year: 2020
Method of publishing: Limited access
https://doi.org/10.1142/S0219061320500026
Permanent Link: http://hdl.handle.net/11104/0308510File Download Size Commentary Version Access Jerabek1.pdf 1 753.9 KB Publisher’s postprint require - 2.0474420 - MÚ 2018 RIV US eng J - Journal Article
Doucha, Michal
Metrically universal abelian groups.
American Mathematical Society. Transactions. Roč. 369, č. 8 (2017), s. 5981-5998. ISSN 0002-9947. E-ISSN 1088-6850
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : Abelian group
OECD category: Pure mathematics
Impact factor: 1.496, year: 2017
http://www.ams.org/journals/tran/2017-369-08/S0002-9947-2017-07059-8/
Permanent Link: http://hdl.handle.net/11104/0271474File Download Size Commentary Version Access Doucha.pdf 7 277 KB Publisher’s postprint require - 3.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/0271451File Download Size Commentary Version Access Pudlak1.pdf 7 433.6 KB Publisher’s postprint require - 4.0468171 - MÚ 2017 RIV DE eng J - Journal Article
Jeřábek, Emil
Cluster expansion and the boxdot conjecture.
Mathematical Logic Quarterly. Roč. 62, č. 6 (2016), s. 608-614. ISSN 0942-5616. E-ISSN 1521-3870
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : modal logic * boxdot translation * cluster expansion
Subject RIV: BA - General Mathematics
Impact factor: 0.250, year: 2016
http://onlinelibrary.wiley.com/doi/10.1002/malq.201600036/abstract
Permanent Link: http://hdl.handle.net/11104/0266023File Download Size Commentary Version Access Jerabek3.pdf 1 165.8 KB Publisher’s postprint require - 5.0465743 - MÚ 2017 RIV US eng J - Journal Article
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman’s theorem in interactive information complexity.
Algorithmica. Roč. 76, č. 3 (2016), s. 749-781. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : communication complexity * information complexity * information theory
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-015-0112-9
Permanent Link: http://hdl.handle.net/11104/0264183File Download Size Commentary Version Access Koucky.pdf 4 630.8 KB Publisher’s postprint require - 6.0457321 - MÚ 2016 RIV US eng J - Journal Article
Epstein, L. - Jeż, Łukasz - Sgall, J. - van Stee, R.
Online scheduling of jobs with fixed start times on related machines.
Algorithmica. Roč. 74, č. 1 (2016), s. 156-176. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online scheduling * online algorithms * related machines
Subject RIV: BA - General Mathematics
Impact factor: 0.735, year: 2016
http://link.springer.com/article/10.1007%2Fs00453-014-9940-2
Permanent Link: http://hdl.handle.net/11104/0257713 - 7.0453982 - MÚ 2016 RIV US eng J - Journal Article
Chodounský, David - Repovš, D. - Zdomskyy, L.
Mathias forcing and combinatorial covering properties of filters.
Journal of Symbolic Logic. Roč. 80, č. 4 (2015), s. 1398-1410. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : Menger space * Hurewicz space * Mathias forcing
Subject RIV: BA - General Mathematics
Impact factor: 0.510, year: 2015
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=10080752
Permanent Link: http://hdl.handle.net/11104/0254708File Download Size Commentary Version Access Chodounsky2.pdf 2 192.2 KB Publisher’s postprint require - 8.0453140 - MÚ 2016 RIV GB eng J - Journal Article
Jeřábek, Emil
Blending margins: The modal logic K has nullary unification type.
Journal of Logic and Computation. Roč. 25, č. 5 (2015), s. 1231-1240. ISSN 0955-792X. E-ISSN 1465-363X
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional support: RVO:67985840
Keywords : modal logic * unification type * rule of margins
Subject RIV: BA - General Mathematics
Impact factor: 0.585, year: 2015
http://logcom.oxfordjournals.org/content/25/5/1231
Permanent Link: http://hdl.handle.net/11104/0254021File Download Size Commentary Version Access Jerabek2.pdf 2 242.4 KB Publisher’s postprint require - 9.0451577 - MÚ 2016 RIV US eng J - Journal Article
Jeřábek, Emil
Integer factoring and modular square roots.
Journal of Computer and System Sciences. Roč. 82, č. 2 (2016), s. 380-394. ISSN 0022-0000. E-ISSN 1090-2724
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : integer factoring * quadratic residue * PPA
Subject RIV: BA - General Mathematics
Impact factor: 1.678, year: 2016
http://www.sciencedirect.com/science/article/pii/S0022000015000768
Permanent Link: http://hdl.handle.net/11104/0252707File Download Size Commentary Version Access Jerabek.pdf 1 416.5 KB Publisher’s postprint require - 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/0249428File Download Size Commentary Version Access Thapen.pdf 2 439.5 KB Publisher’s postprint require