المؤلفون: Harms, Nathaniel, Riazanov, Artur

مصطلحات موضوعية: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms

URL الوصول: http://arxiv.org/abs/2410.00838

المؤلفون: Glinskih, Ludmila, Riazanov, Artur

مصطلحات موضوعية: Computer Science - Computational Complexity

URL الوصول: http://arxiv.org/abs/2407.04632

المؤلفون: Gryaznov, Svyatoslav, Ovcharov, Sergei, Riazanov, Artur

مصطلحات موضوعية: Computer Science - Computational Complexity

URL الوصول: http://arxiv.org/abs/2404.08370

المؤلفون: Filmus, Yuval, Leigh, Itai, Riazanov, Artur, Sokolov, Dmitry

مصطلحات موضوعية: Computer Science - Computational Complexity, 03D15, F.2.2

URL الوصول: http://arxiv.org/abs/2305.04363

المؤلفون: Göös, Mika, Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry

مصطلحات موضوعية: Computer Science - Computational Complexity

URL الوصول: http://arxiv.org/abs/2304.02555

المؤلفون: Filmus, Yuval, Hirsch, Edward A., Riazanov, Artur, Smal, Alexander, Vinyals, Marc

مصطلحات موضوعية: Computer Science - Computational Complexity, Mathematics - Logic, 03F20, F.2.2

URL الوصول: http://arxiv.org/abs/2302.06241

المؤلفون: Filmus, Yuval, Hirsch, Edward, Kurz, Sascha, Ihringer, Ferdinand, Riazanov, Artur, Smal, Alexander, Vinyals, Marc

مصطلحات موضوعية: Mathematics - Combinatorics

URL الوصول: http://arxiv.org/abs/2212.14685

المؤلفون: Filmus, Yuval, Hirsch, Edward A., Riazanov, Artur, Smal, Alexander, Vinyals, Marc

المساهمون: Yuval Filmus and Edward A. Hirsch and Artur Riazanov and Alexander Smal and Marc Vinyals

مصطلحات موضوعية: hitting formulas, polynomial identity testing, query complexity

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.48

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2024.48
https://nbn-resolving.org/urn:nbn:de:0030-drops-195762
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.48

المؤلفون: Itsykson, Dmitry, Riazanov, Artur

المساهمون: Dmitry Itsykson and Artur Riazanov

مصطلحات موضوعية: proof complexity, OBDD, automatability, lifting, dag-like communication

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.59

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2022.59
https://nbn-resolving.org/urn:nbn:de:0030-drops-168575
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.59

المؤلفون: Itsykson, Dmitry, Riazanov, Artur, Smirnov, Petr

المساهمون: Dmitry Itsykson and Artur Riazanov and Petr Smirnov

مصطلحات موضوعية: Proof complexity, Tseitin formulas, treewidth, resolution, OBDD-based proof systems

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.6

الاتاحة: https://doi.org/10.4230/LIPIcs.SAT.2022.6
https://nbn-resolving.org/urn:nbn:de:0030-drops-166805
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.6

المؤلفون: Filmus, Yuval, Hirsch, Edward, Ihringer, Ferdinand, Kurz, Sascha, Riazanov, Artur, Smal, Alexander, Vinyals, Marc

مصطلحات موضوعية: 004 Informatik, 510 Mathematik

وصف الملف: application/pdf

Relation: https://epub.uni-bayreuth.de/id/eprint/6837/1/Irreducible%20Subcube%20Partitions.pdf; Filmus, Yuval; Hirsch, Edward; Ihringer, Ferdinand; Kurz, Sascha; Riazanov, Artur; Smal, Alexander; Vinyals, Marc: Irreducible Subcube Partitions. Bayreuth , 2023 . - 38 S.

الاتاحة: https://epub.uni-bayreuth.de/id/eprint/6837/
https://epub.uni-bayreuth.de/id/eprint/6837/1/Irreducible%20Subcube%20Partitions.pdf

المؤلفون: Göös, Mika, Newman, Ilan, Riazanov, Artur, Sokolov, Dmitry

المساهمون: Swiss State Secretariat for Education, Research and Innovation

المصدر: Proceedings of the 56th Annual ACM Symposium on Theory of Computing

الاتاحة: http://dx.doi.org/10.1145/3618260.3649711
https://dl.acm.org/doi/pdf/10.1145/3618260.3649711

المؤلفون: Yuval Filmus and Edward A. Hirsch and Artur Riazanov and Alexander Smal and Marc Vinyals, Filmus, Yuval, Hirsch, Edward A., Riazanov, Artur, Smal, Alexander, Vinyals, Marc

مصطلحات الفهرس: hitting formulas, polynomial identity testing, query complexity, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.48
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)

المؤلفون: Itsykson, Dmitry, Riazanov, Artur

المساهمون: Dmitry Itsykson and Artur Riazanov

مصطلحات موضوعية: bit pigeonhole principle, disjointness, multiparty communication complexity, perfect matching, proof complexity, randomized communication complexity, Resolution over linear equations, tree-like proofs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.3

الاتاحة: https://doi.org/10.4230/LIPIcs.CCC.2021.3
https://nbn-resolving.org/urn:nbn:de:0030-drops-142773
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.3

المؤلفون: Galesi, Nicola, Itsykson, Dmitry, Riazanov, Artur, Sofronova, Anastasia

المساهمون: Nicola Galesi and Dmitry Itsykson and Artur Riazanov and Anastasia Sofronova

مصطلحات موضوعية: Tseitin formula, treewidth, AC0-Frege

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.49

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2019.49
https://nbn-resolving.org/urn:nbn:de:0030-drops-109932
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.49

المؤلفون: Galesi, Nicola, Itsykson, Dmitry, Riazanov, Artur, Sofronova, Anastasia

المساهمون: Russian Science Foundation

المصدر: Annals of Pure and Applied Logic ; volume 174, issue 1, page 103166 ; ISSN 0168-0072

الاتاحة: http://dx.doi.org/10.1016/j.apal.2022.103166
https://api.elsevier.com/content/article/PII:S0168007222000811?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0168007222000811?httpAccept=text/plain

المؤلفون: Glinskih, Ludmila, Riazanov, Artur

المصدر: LATIN 2022: Theoretical Informatics ; Lecture Notes in Computer Science ; page 626-640 ; ISSN 0302-9743 1611-3349 ; ISBN 9783031206238 9783031206245

الاتاحة: http://dx.doi.org/10.1007/978-3-031-20624-5_38
https://link.springer.com/content/pdf/10.1007/978-3-031-20624-5_38

المؤلفون: Dmitry Itsykson and Artur Riazanov, Itsykson, Dmitry, Riazanov, Artur

مصطلحات الفهرس: proof complexity, OBDD, automatability, lifting, dag-like communication, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.59
Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)

المؤلفون: Itsykson, Dmitry, Riazanov, Artur, Sagunov, Danil, Smirnov, Petr

المصدر: computational complexity ; volume 30, issue 2 ; ISSN 1016-3328 1420-8954

الاتاحة: https://doi.org/10.1007/s00037-021-00216-z
https://link.springer.com/content/pdf/10.1007/s00037-021-00216-z.pdf
https://link.springer.com/article/10.1007/s00037-021-00216-z/fulltext.html

المؤلفون: Itsykson, Dmitry, Riazanov, Artur, Sagunov, Danil, Smirnov, Petr

المصدر: computational complexity ; volume 30, issue 2 ; ISSN 1016-3328 1420-8954

الاتاحة: http://dx.doi.org/10.1007/s00037-021-00213-2
https://link.springer.com/content/pdf/10.1007/s00037-021-00213-2.pdf
https://link.springer.com/article/10.1007/s00037-021-00213-2/fulltext.html