Proof complexity and beyond. Abstracts from the workshop held August 13--19, 2017
DOI10.4171/OWR/2017/37zbMATH Open1394.00005OpenAlexW2811274606WikidataQ129547870 ScholiaQ129547870MaRDI QIDQ1668297
Author name not available (Why is that?)
Publication date: 3 September 2018
Published in: Oberwolfach Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/owr/2017/37
Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Proceedings of conferences of miscellaneous specific interest (00B25) Combinatorial optimization (90C27) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Collections of abstracts of lectures (00B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) History of mathematical logic and foundations (03-03) Approximation algorithms (68W25) Complexity of proofs (03F20)
Related Items (1)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Computability theory. Abstracts from the workshop held February 5--11, 2012. π π
- Complexity theory. Abstracts from the workshop held November 11--17, 2018 π π
- Complexity theory. Abstracts from the workshop held June 24--30, 2007. π π
- Proceedings of the workshop on proof theory and complexity, PTAC '98, Aarhus, Denmark, August 3--7, 1998 π π
- Complexity theory. Abstracts from the workshop held November 15--21, 2015 π π
- Computability theory. Abstracts from the workshop held January 7--13, 2018 π π
- Complexity of Propositional Proofs π π
- Proofs, Programs and Abstract Complexity π π
This page was built for publication: Proof complexity and beyond. Abstracts from the workshop held August 13--19, 2017
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668297)