diff 96808cb..d214c92 variable_dim_weisfeiler_leman_v2.txt
diff --git a/variable_dim_weisfeiler_leman_v2.txt b/variable_dim_weisfeiler_leman_v2.txt index e5e0ca5..8de1a8f 100644 --- a/variable_dim_weisfeiler_leman_v2.txt +++ b/variable_dim_weisfeiler_leman_v2.txt @@ -16,21 +16,10 @@ are connected, simple, uncolored, of the same positive order, and of maximum degree at most three. -CONTENTS - 0. How to read this. - 1. What is proved, and why it is surprising. - 2. Refinement, the counting game, and the upper bound. - 3. A computation written as a small circuit. - 4. Consistency of scalar images. - 5. Affine blocks and exact projection. - 6. The general graph realization and the game transfer. - 7. The connected subcubic realization. - 8. Uniform size and time bounds; completeness. - A. Notation. -0. HOW TO READ THIS. +0. THE SHAPE OF THE PROOF. There is one main theorem and one long reduction. The reduction turns an arbitrary exponential-time computation into a pair of polynomial-size