Complexity theory. Abstracts from the workshop held November 11--17, 2012.

DOI10.4171/OWR/2012/54zbMath1349.00096OpenAlexW4233213922MaRDI QIDQ343366

No author found.

Publication date: 27 November 2016

Published in: Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/owr/2012/54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Linear codes (general theory) (94B05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Collections of abstracts of lectures (00B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decoding (94B35)

Cites Work

• DNF sparsification and a faster deterministic counting algorithm

This page was built for publication: Complexity theory. Abstracts from the workshop held November 11--17, 2012.