×

Complexity theory. Abstracts from the workshop held November 11–17, 2018. (English) Zbl 1439.00052

Summary: Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various sub-areas including arithmetic complexity, Boolean complexity, communication complexity, cryptography, probabilistic proof systems, pseudorandomness, and quantum computation. Many of the developments are related to diverse mathematical fields such as algebraic geometry, combinatorial number theory, probability theory, representation theory, and the theory of error-correcting codes.

MSC:

00B05 Collections of abstracts of lectures
00B25 Proceedings of conferences of miscellaneous specific interest
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q01 General topics in the theory of computing
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] David A.Barrington.Bounded-width polynomial-size branching programs recognize exactly those languages in NC1.J. Comput. Syst. Sci. 38(1) (1989), 150-164. · Zbl 0667.68059
[2] Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson.In search of an easy witness: exponential time vs. probabilistic polynomial time.J. Comput. Syst. Sci. 65(4) (2002), 672-694. · Zbl 1059.68047
[3] Cody Murray and R. Ryan Williams.Circuit lower bounds for nondeterministic quasipolytime: an easy witness lemma for NP and NQP. Proceedings ofSTOC(2018), 890-901. · Zbl 1428.68172
[4] Ryan Williams.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.