Which Regular Expression Patterns are Hard to Match?
637 views · Published 8 December 2015 · 23:27 · Indexed 21 September 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Arturs Backurs, Massachusetts Institute of Technology Computational Complexity of Low-Polynomial Time Problems https://simons.berkeley.edu/talks/arturs-backurs-2015-12-01
More from this channel
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
1:03:10
Decay of Correlations in Spin Systems
-
34:02
Modelling Gene Expression Dynamics with Gaussian Processes
-
37:26
Telomere Length, Nature and Nurture
-
31:01
Simple Models and Exact Algorithms for Computing Network Modules
-
44:30
Sum of Squares SDP Relaxations on Random Tensors