categories, representations, and counting complexity
Published 8 years ago • 163 plays • Length 44:25Download video MP4
Download video MP3
Similar videos
-
34:02
the sketching complexity of graph and hypergraph counting
-
30:56
fine-grained complexity classification of counting problems
-
1:02:06
fine-grained counting complexity ii
-
1:02:04
fine-grained counting complexity i
-
52:08
does computational complexity restrict artificial intelligence (ai) and machine learning?
-
20:14
tfnp characterizations of proof systems and monotone circuits
-
1:04:46
how complex is complexity? or what’s a ‘meta’ for?
-
57:32
dichotomy theorems for counting problems ii
-
1:07:30
the simple, little and slow things count: on parameterized counting complexity
-
47:02
the computational complexity of counting list h-colourings, and related problems
-
1:00:14
the classification program for counting problems i
-
47:20
counting approximation complexity classification through clones and invariants
-
1:02:31
the classification program for counting problems ii
-
28:26
the logic of counting query answers
-
57:53
dichotomy theorems for counting problems i
-
56:06
hyperbolic polynomials and determinantal representations, part i
-
43:09
reasoning systems from descriptive complexity
-
47:42
enumerator polynomials: completeness and intermediate complexity
-
15:14
sampling and approximately counting cnf formula solutions in the local lemma regime
-
47:37
approximately counting graph homomorphisms