Search results
- 1.0518434 - MÚ 2020 RIV US eng C - Conference Paper (international conference)
Galesi, N. - Kolodziejczyk, L. A. - Thapen, Neil
Polynomial calculus space and resolution width.
60th Annual Symposium on Foundations of Computer Science (FOCS). Piscataway: IEEE, 2019, s. 1325-1337. ISBN 978-1-7281-4952-3. ISSN 0272-5428.
[60th Annual Symposium on Foundations of Computer Science (FOCS). Baltimore (US), 09.11.2019-12.11.2019]
R&D Projects: GA ČR(CZ) GA19-05497S
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : polynomial calculus * proof complexity * resolution
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://dx.doi.org/10.1109/FOCS.2019.00081
Permanent Link: http://hdl.handle.net/11104/0303569File Download Size Commentary Version Access Thapen1.pdf 7 253.9 KB Publisher’s postprint require - 2.0507746 - MÚ 2020 RIV DE eng C - Conference Paper (international conference)
Hrubeš, Pavel - Natarajan Ramamoorthy, S. - Rao, A. - Yehudayoff, A.
Lower bounds on balancing sets and depth-2 threshold circuits.
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2019 - (Baier, C.; Chatzigiannakis, I.; Flocchini, P.; Leonardi, S.), č. článku 72. Leibniz International Proceedings in Informatics (LIPIcs), 132. ISBN 978-3-95977-109-2. ISSN 1868-8969.
[46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Patras (GR), 08.07.2019-12.07.2019]
R&D Projects: GA ČR(CZ) GX19-27871X
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : balancing sets * depth-2 threshold circuits * polynomials * majority * weighted thresholds
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/2019/10648/
Permanent Link: http://hdl.handle.net/11104/0298721File Download Size Commentary Version Access Hrubes1.pdf 1 525.4 KB Publisher’s postprint open-access - 3.0507739 - MÚ 2020 RIV CH eng C - Conference Paper (international conference)
Buss, S. - Thapen, Neil
DRAT proofs, propagation redundancy, and extended resolution.
Theory and Applications of Satisfiability Testing – SAT 2019. Cham: Springer, 2019 - (Janota, M.; Lynce, I.), s. 71-89. Lecture Notes in Computer Science, 11628. ISBN 978-3-030-24257-2. ISSN 0302-9743.
[22nd International Conference on Theory and Applications of Satisfiability Testing (SAT 2019). Lisbon (PT), 09.07.2019-12.07.2019]
R&D Projects: GA ČR(CZ) GA19-05497S
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : lower bounds * proof complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007%2F978-3-030-24258-9_5
Permanent Link: http://hdl.handle.net/11104/0298715File Download Size Commentary Version Access Thapen.pdf 0 358.2 KB Publisher’s postprint require - 4.0505928 - MÚ 2020 RIV DE eng C - Conference Paper (international conference)
Jalali Keshavarz, Raheleh
An exponential lower bound for proofs in focused calculi.
Logic, Language, Information, and Computation. Berlin: Springer, 2019 - (Iemhoff, R.; Moortgat, M.; de Queiroz, R.), s. 342-355. Lecture Notes in Computer Science, 11541. ISBN 978-3-662-59532-9. ISSN 0302-9743.
[26th International Workshop, WoLLIC 2019. Utrecht (NL), 02.07.2019-05.07.2019]
R&D Projects: GA ČR(CZ) GA19-05497S
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : focused calculi * propositional proof complexity * feasible interpolation * super-intuitionistic logics
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007/978-3-662-59533-6_21
Permanent Link: http://hdl.handle.net/11104/0297260File Download Size Commentary Version Access Jalali.pdf 0 214.1 KB Publisher’s postprint require - 5.0491873 - MÚ 2019 RIV CH eng C - Conference Paper (international conference)
Galesi, N. - Talebanfard, Navid - Torán, J.
Cops-Robber games and the resolution of Tseitin formulas.
Theory and Applications of Satisfiability Testing – SAT 2018. Cham: Springer, 2018 - (Beyersdorff, O.; Wintersteiger, C.), s. 311-326. Lecture Notes in Computer Science, 10929. ISBN 978-3-319-94143-1. ISSN 0302-9743.
[21st International Conference, SAT 2018. Oxford (GB), 09.07.2018-12.07.2018]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : formal logic * computer circuits
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007%2F978-3-319-94144-8_19
Permanent Link: http://hdl.handle.net/11104/0285479File Download Size Commentary Version Access Talebanfard1.pdf 2 241 KB Publisher’s postprint require - 6.0483703 - MÚ 2018 RIV US eng C - Conference Paper (international conference)
Hrubeš, Pavel - Pudlák, Pavel
Random formulas, monotone circuits, and interpolation.
2017 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS). New York: IEEE, 2017, s. 121-131. Annual IEEE Symposium on Foundations of Computer Science. ISBN 978-1-5386-3464-6. ISSN 0272-5428.
[58th IEEE Annual Symposium on Foundations of Computer Science (FOCS). Berkeley (US), 15.10.2017-17.10.2017]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : Cutting Planes * random formulas * interpolation
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://ieeexplore.ieee.org/document/8104052/
Permanent Link: http://hdl.handle.net/11104/0278908File Download Size Commentary Version Access Hrubes.pdf 11 296.4 KB Publisher’s postprint require - 7.0477105 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel - de Oliveira Oliveira, Mateus
Representations of monotone Boolean functions by linear programs.
32nd Computational Complexity Conference (CCC 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (O’Donnell, R.), s. 1-14, č. článku 3. 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 : Monotone Linear Programming Circuits * Lovász-Schrijver Proof System * Cutting-Planes Proof System
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/7520
Permanent Link: http://hdl.handle.net/11104/0273491File Download Size Commentary Version Access DeOliveiraOliveira2.pdf 2 534.9 KB Publisher’s postprint require - 8.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/0273490File Download Size Commentary Version Access Pudlak3.pdf 3 538.1 KB Publisher’s postprint require - 9.0476164 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
de Oliveira Oliveira, Mateus
Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth.
11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Guo, J.; Hermelin, D.), s. 1-12, č. článku 25. Leibniz International Proceedings in Informatics, 63. ISBN 978-3-95977-023-1. ISSN 1868-8969.
[11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Aarhus (DK), 24.08.2016-26.08.2016]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : linear term rewriting systems * ground reachability * ground joinability * fixed parameter tractability
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/6925/
Permanent Link: http://hdl.handle.net/11104/0272695File Download Size Commentary Version Access DeOliveiraOliveira1.pdf 3 669.5 KB Publisher’s postprint require - 10.0465189 - MÚ 2017 RIV CH eng C - Conference Paper (international conference)
de Oliveira Oliveira, Mateus
Satisfiability via smooth pictures.
Theory and Applications of Satisfiability Testing – SAT 2016. Cham: Springer, 2016 - (Creignou, N.; Le Berre, D.), s. 13-28. Lecture Notes in Computer Science, 9710. ISBN 978-3-319-40969-6. ISSN 0302-9743.
[19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016). Bordeaux (FR), 05.07.2016-08.07.2016]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : smooth pictures * bounded frege proof systems * pigeonhole principle
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-319-40970-2_2
Permanent Link: http://hdl.handle.net/11104/0263852File Download Size Commentary Version Access deOliveiraOliveira5.pdf 1 394.8 KB Publisher’s postprint require