Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Dmitry Sokolov. Pseudorandom Generators, Resolution and Heavy Width. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 15:1-15:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{sokolov:LIPIcs.CCC.2022.15, author = {Sokolov, Dmitry}, title = {{Pseudorandom Generators, Resolution and Heavy Width}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {15:1--15:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.15}, URN = {urn:nbn:de:0030-drops-165770}, doi = {10.4230/LIPIcs.CCC.2022.15}, annote = {Keywords: proof complexity, pseudorandom generators, resolution, lower bounds} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Anastasia Sofronova and Dmitry Sokolov. Branching Programs with Bounded Repetitions and Flow Formulas. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 17:1-17:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{sofronova_et_al:LIPIcs.CCC.2021.17, author = {Sofronova, Anastasia and Sokolov, Dmitry}, title = {{Branching Programs with Bounded Repetitions and Flow Formulas}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {17:1--17:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.17}, URN = {urn:nbn:de:0030-drops-142915}, doi = {10.4230/LIPIcs.CCC.2021.17}, annote = {Keywords: proof complexity, branching programs, bounded repetitions, lower bounds} }
Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Yaroslav Alekseev. A Lower Bound for Polynomial Calculus with Extension Rule. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 21:1-21:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{alekseev:LIPIcs.CCC.2021.21, author = {Alekseev, Yaroslav}, title = {{A Lower Bound for Polynomial Calculus with Extension Rule}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.21}, URN = {urn:nbn:de:0030-drops-142959}, doi = {10.4230/LIPIcs.CCC.2021.21}, annote = {Keywords: proof complexity, algebraic proofs, polynomial calculus} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Fedor Part and Iddo Tzameret. Resolution with Counting: Dag-Like Lower Bounds and Different Moduli. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 19:1-19:37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{part_et_al:LIPIcs.ITCS.2020.19, author = {Part, Fedor and Tzameret, Iddo}, title = {{Resolution with Counting: Dag-Like Lower Bounds and Different Moduli}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {19:1--19:37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.19}, URN = {urn:nbn:de:0030-drops-117041}, doi = {10.4230/LIPIcs.ITCS.2020.19}, annote = {Keywords: Proof complexity, concrete lower bounds, resolution, satisfiability, combinatorics} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, and Alexander S. Kulikov. On the Limits of Gate Elimination. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{golovnev_et_al:LIPIcs.MFCS.2016.46, author = {Golovnev, Alexander and Hirsch, Edward A. and Knop, Alexander and Kulikov, Alexander S.}, title = {{On the Limits of Gate Elimination}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.46}, URN = {urn:nbn:de:0030-drops-64593}, doi = {10.4230/LIPIcs.MFCS.2016.46}, annote = {Keywords: circuit complexity, lower bounds, gate elimination} }
Published in: Dagstuhl Reports, Volume 4, Issue 10 (2015)
Olaf Beyersdorff, Edward A. Hirsch, Jan Krajicek, and Rahul Santhanam. Optimal algorithms and proofs (Dagstuhl Seminar 14421). In Dagstuhl Reports, Volume 4, Issue 10, pp. 51-68, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@Article{beyersdorff_et_al:DagRep.4.10.51, author = {Beyersdorff, Olaf and Hirsch, Edward A. and Krajicek, Jan and Santhanam, Rahul}, title = {{Optimal algorithms and proofs (Dagstuhl Seminar 14421)}}, pages = {51--68}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {4}, number = {10}, editor = {Beyersdorff, Olaf and Hirsch, Edward A. and Krajicek, Jan and Santhanam, Rahul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.10.51}, URN = {urn:nbn:de:0030-drops-48923}, doi = {10.4230/DagRep.4.10.51}, annote = {Keywords: computational complexity, proof complexity, approximation algorithms, optimal algorithms, optimal proof systems, speedup theorems} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Edward A. Hirsch and Dmitry Itsykson. On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 453-464, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{hirsch_et_al:LIPIcs.STACS.2010.2475, author = {Hirsch, Edward A. and Itsykson, Dmitry}, title = {{On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {453--464}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2475}, URN = {urn:nbn:de:0030-drops-24753}, doi = {10.4230/LIPIcs.STACS.2010.2475}, annote = {Keywords: Propositional proof complexity, optimal algorithm} }
Feedback for Dagstuhl Publishing