Search results
- 1.0490784 - ÚI 2019 RIV CH eng C - Conference Paper (international conference)
Šíma, Jiří
Three Analog Neurons Are Turing Universal.
Theory and Practice of Natural Computing. Cham: Springer, 2018 - (Fagan, D.; Martín-Vide, C.; O'Neill, M.; Vega-Rodríguez, M.), s. 460-472. Lecture Notes in Computer Science, 11324. ISBN 978-3-030-04069-7. ISSN 0302-9743.
[TPNC 2018. International Conference on the Theory and Practice of Natural Computing /7./. Dublin (IE), 12.12.2018-14.12.2018]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : analog neural network * Turing machine * Chomsky hierarchy
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0284924 - 2.0487435 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Anshu, A. - Gavinsky, Dmitry - Jain, R. - Kundu, S. - Lee, T. - Mukhopadhyay, P. - Santha, M. - Sanyal, S.
A composition theorem for randomized query complexity.
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2018 - (Lokam, S.; Ramanujam, R.), s. 1-13, č. článku 10. Leibniz International Proceedings in Informatics, 93. ISBN 978-3-95977-055-2. ISSN 1868-8969.
[37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Kanpur (IN), 11.12.2017-15.12.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : query algorithms and complexity * decision trees * composition theorem
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/2018/8396/
Permanent Link: http://hdl.handle.net/11104/0282096File Download Size Commentary Version Access Gavinsky.pdf 0 554.5 KB Publisher’s postprint require - 3.0486446 - ÚI 2018 RIV CZ eng C - Conference Paper (international conference)
Šíma, Jiří
The Computational Power of Neural Networks and Representations of Numbers in Non-Integer Bases.
Mendel 2017. Brno: University of Technology, 2017, s. 103-110. Mendel Journal Series, 23. ISSN 1803-3814.
[MENDEL 2017. International Conference on Soft Computing /23./. Brno (CZ), 20.06.2017-22.06.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : neural network * Chomsky hierarchy * beta-expansion * cut language
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://www.mendel-conference.org/?link=invited17
Permanent Link: http://hdl.handle.net/11104/0281255File Download Size Commentary Version Access 0486446.pdf 1 713 KB Author´s preprint open-access a0486446.pdf 2 12.7 MB Publisher’s postprint require 0486446 invited.pdf 9 605.5 KB Other open-access - 4.0480888 - ÚI 2018 DE eng C - Conference Paper (international conference)
Savický, Petr - Kučera, P.
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. Freiburg: IJCAI, 2017 - (Sierra, C.), s. 5055-5059. ISBN 978-0-9992411-0-3.
[IJCAI 2017. International Joint Conference on Artificial Intelligence /26./. Melbourne (AU), 19.08.2017-25.08.2017]
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR GA15-15511S
Institutional support: RVO:67985807
Keywords : conjunctive normal form * matched formula * pure literal satisfiable formula
Subject RIV: BA - General Mathematics
https://www.ijcai.org/proceedings/2017/0721.pdf
Permanent Link: http://hdl.handle.net/11104/0276554File Download Size Commentary Version Access a0480888.pdf 1 104.2 KB Publisher’s postprint require - 5.0478486 - ÚI 2018 RIV CH eng C - Conference Paper (international conference)
Kučera, P. - Savický, Petr - Vorel, V.
A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Theory and Applications of Satisfiability Testing - SAT 2017. Cham: Springer, 2017 - (Gaspers, S.; Walsh, T.), s. 412-428. Lecture Notes in Computer Science, 10491. ISBN 978-3-319-66262-6. ISSN 0302-9743.
[SAT 2017. International Conference on Theory and Applications of Satisfiability Testing /20./. Melbourne (AU), 28.08.2017-01.09.2017]
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR(CZ) GA15-15511S
Institutional support: RVO:67985807
Keywords : Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0274603File Download Size Commentary Version Access 0478486.pdf 2 801.7 KB Author´s preprint open-access a0478486.pdf 4 310.6 KB Publisher’s postprint require - 6.0476174 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel - Scheder, D. - Talebanfard, Navid
Tighter Hard Instances for PPSZ.
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Chatzigiannakis, I.; Indyk, P.; Kuhn, F.; Muscholl, A.), s. 1-13, č. článku 85. Leibniz International Proceedings in Informatics, 80. ISBN 978-3-95977-041-5. ISSN 1868-8969.
[44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Warsaw (PL), 10.07.2017-14.07.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : k-SAT * strong exponential time hypothesis * PPSZ * 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/frontdoor.php?source_opus=7414
Permanent Link: http://hdl.handle.net/11104/0272702File Download Size Commentary Version Access Pudlak2.pdf 2 587.8 KB Publisher’s postprint require - 7.0472477 - ÚI 2017 RIV CH eng C - Conference Paper (international conference)
Šíma, Jiří
Energy-Time Tradeoff in Recurrent Neural Nets.
Artificial Neural Networks. Methods and Applications in Bio-/Neuroinformatics. Cham: Springer, 2015 - (Koprinkova-Hristova, P.; Mladenov, V.; Kasabov, N.), s. 51-62. Springer Series in Bio-/Neuroinformatics, 4. ISBN 978-3-319-09902-6. ISSN 2193-9349.
[ICANN 2013. International Conference on Artificial Neural Networks /23./. Sofia (BG), 10.09.2013-13.09.2013]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : energy complexity * recurrent neural network * finite automaton * energy-time tradeoff
Subject RIV: IN - Informatics, Computer Science
https://link.springer.com/content/pdf/bfm:978-3-319-09903-3/1
Permanent Link: http://hdl.handle.net/11104/0269779File Download Size Commentary Version Access a0472477.pdf 2 272.2 KB Publisher’s postprint require 0472477.pdf 1 648.5 KB Author´s preprint open-access - 8.0470700 - ÚI 2018 RIV US eng C - Conference Paper (international conference)
Šíma, Jiří
Neural Networks Between Integer and Rational Weights.
Proceedings of the 2017 International Joint Conference on Neural Networks. Piscataway: IEEE Operations Center, 2017, s. 154-161. ISBN 978-1-5090-6182-2. ISSN 2161-4407.
[IJCNN 2017. International Joint Conference on Neural Networks /30./. Anchorage (US), 14.05.2017-19.05.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : computational power * recurrent neural networks * rational weights * cut language * beta-expansion
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0268293File Download Size Commentary Version Access obal 0470700.pdf 0 420.7 KB Publisher’s postprint require a0470700.pdf 1 770.1 KB Publisher’s postprint require - 9.0467765 - ÚI 2017 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří - Savický, Petr
Cut Languages in Rational Bases.
Language and Automata Theory and Applications. Cham: Springer, 2017 - (Drews, F.; Martín-Vide, C.; Truthe, B.), s. 311-322. Lecture Notes in Computer Science, 10168. ISBN 978-3-319-53732-0. ISSN 0302-9743.
[LATA 2017. International Conference on Language and Automata Theory and Applications /11./. Umea (SE), 06.03.2017-09.03.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : grammars * quasi-periodic power series * cut language
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0265800File Download Size Commentary Version Access 0467765.pdf 0 787.5 KB Author´s preprint open-access a0467765.pdf 0 266.9 KB Publisher’s postprint require - 10.0465841 - ÚI 2017 RIV GB eng C - Conference Paper (international conference)
Sedlár, Igor
Propositional Dynamic Logic with Belnapian Truth Values.
Advances in Modal Logic. Vol. 11. London: College Publications, 2016 - (Beklemishev, L.; Demri, S.; Máté, A.), s. 503-519. ISBN 978-1-84890-201-5.
[AIML 2016. Advances in Modal Logic. Budapest (HU), 30.08.2016-02.09.2016]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : Belnap-Dunn logic * four-valued logic * propositional dynamic logic
Subject RIV: BA - General Mathematics
https://www.collegepublications.co.uk/aiml/?00008
Permanent Link: http://hdl.handle.net/11104/0264286File Download Size Commentary Version Access a0465841.pdf 6 7.8 MB Publisher’s postprint require 0465841.pdf 8 440.5 KB Author´s preprint open-access