WikiLeanRecent changes · Proposals · Flags · Stats · About

Diff — Computational complexity theory

Revision #1725 → #2191 · back to history

modifiedPrimality testing instance9354d69ce6bc
FieldFrom #1725To #2191
mathlib.match_kindinvocation
modifiedInstance as string over an alphabet77f65e368822
FieldFrom #1725To #2191
mathlib.match_kindgeneralization
addedGraph encoding via adjacency matrixb6eebb08b077
modifiedDecision problemf73b86acb908
FieldFrom #1725To #2191
mathlib.match_kindgeneralization
modifiedGraph connectivity decision problem46a880d7fb56
FieldFrom #1725To #2191
mathlib.match_kindinvocation
modifiedWorst-case time complexity253578e2296a
FieldFrom #1725To #2191
mathlib.match_kindgeneralization
modifiedEquivalence of deterministic machine models279ea0750e4e
FieldFrom #1725To #2191
mathlib.match_kindspecial_case
modifiedTime required by a Turing machine6571885d332c
FieldFrom #1725To #2191
mathlib.match_kindinvocation
modifiedComplexity class Pd14aa02b376d
FieldFrom #1725To #2191
mathlib.match_kindinvocation
modifiedReductione7bb7a21f897
FieldFrom #1725To #2191
mathlib.match_kindgeneralization
addedP versus NP problemb19590b66fe5
addedHamiltonian path problem6a6ab9b9d132
addedVertex cover problem69e5e9886eed
modifiedGraph isomorphism problem03e8c9553a2c
FieldFrom #1725To #2191
mathlib.match_kindinvocation
addedPolynomial hierarchy7ffafe45ba89
modifiedInteger factorization problem91107ee26cda
FieldFrom #1725To #2191
mathlib.match_kindinvocation
modifiedPresburger arithmetic not in Pe3557cb85f99
FieldFrom #1725To #2191
mathlib.match_kindinvocation
addedKnapsack problemaf7057e68362
addedEuclidean algorithm runtime2b3c800942ed