OAI/Computability/MaxCut/Encoding/Serialization.lean
23 declarations, 0 contain sorry, 0 declared as axioms
Concrete finite-alphabet serialization primitives. A natural word n is n
one-bits followed by a zero delimiter. These are size and decoding theorems, not
running-time certificates. In particular, output length is never called runtime.
- def
OAI.MaxCutGames.Foundations.Complexity.encodeWordline 14 - def
OAI.MaxCutGames.Foundations.Complexity.encodeWordsline 16 - def
OAI.MaxCutGames.Foundations.Complexity.decodeWordsAuxline 20 - def
OAI.MaxCutGames.Foundations.Complexity.decodeWordsline 26 - theorem
OAI.MaxCutGames.Foundations.Complexity.decodeWordsAux_wordline 28 - theorem
OAI.MaxCutGames.Foundations.Complexity.decodeWords_encodeWordsline 38 - theorem
OAI.MaxCutGames.Foundations.Complexity.encodeWords_injectiveline 46 - theorem
OAI.MaxCutGames.Foundations.Complexity.encodeWord_lengthline 51 - theorem
OAI.MaxCutGames.Foundations.Complexity.encodeWords_appendline 54 - theorem
OAI.MaxCutGames.Foundations.Complexity.encodeWords_lengthline 60 - theorem
OAI.MaxCutGames.Foundations.Complexity.encodeWords_length_leline 66 - def
OAI.MaxCutGames.Foundations.Complexity.literalWordsline 80 - def
OAI.MaxCutGames.Foundations.Complexity.clauseWordsline 83 - def
OAI.MaxCutGames.Foundations.Complexity.formulaWordsline 86 - def
OAI.MaxCutGames.Foundations.Complexity.formulaBitsline 89 - theorem
OAI.MaxCutGames.Foundations.Complexity.literalWords_lengthline 91 - theorem
OAI.MaxCutGames.Foundations.Complexity.clauseWords_lengthline 94 - theorem
OAI.MaxCutGames.Foundations.Complexity.clausesWords_lengthline 97 - theorem
OAI.MaxCutGames.Foundations.Complexity.formulaWords_lengthline 106 - theorem
OAI.MaxCutGames.Foundations.Complexity.literalBits_length_leline 111 - theorem
OAI.MaxCutGames.Foundations.Complexity.clauseBits_length_leline 116 - theorem
OAI.MaxCutGames.Foundations.Complexity.clausesBits_length_leline 124 - theorem
OAI.MaxCutGames.Foundations.Complexity.formulaBits_length_leline 134