Published in: LIPIcs, Volume 33, 30th Conference on Computational Complexity (CCC 2015)
Fu Li, Iddo Tzameret, and Zhengyu Wang. Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs. In 30th Conference on Computational Complexity (CCC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 33, pp. 412-432, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{li_et_al:LIPIcs.CCC.2015.412, author = {Li, Fu and Tzameret, Iddo and Wang, Zhengyu}, title = {{Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {412--432}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-81-1}, ISSN = {1868-8969}, year = {2015}, volume = {33}, editor = {Zuckerman, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.412}, URN = {urn:nbn:de:0030-drops-50585}, doi = {10.4230/LIPIcs.CCC.2015.412}, annote = {Keywords: Proof complexity, algebraic complexity, arithmetic circuits, Frege, non-commutative formulas} }
Published in: Dagstuhl Seminar Proceedings, Volume 5391, Algebraic and Numerical Algorithms and Computer-assisted Proofs (2006)
Götz Alefeld and Zhengyu Wang. Verification of Solutions for Almost Linear Complementarity Problems. In Algebraic and Numerical Algorithms and Computer-assisted Proofs. Dagstuhl Seminar Proceedings, Volume 5391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{alefeld_et_al:DagSemProc.05391.9, author = {Alefeld, G\"{o}tz and Wang, Zhengyu}, title = {{Verification of Solutions for Almost Linear Complementarity Problems}}, booktitle = {Algebraic and Numerical Algorithms and Computer-assisted Proofs}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5391}, editor = {Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05391.9}, URN = {urn:nbn:de:0030-drops-4431}, doi = {10.4230/DagSemProc.05391.9}, annote = {Keywords: Complementarity problems, verification of solutions} }
Feedback for Dagstuhl Publishing