- MaximalSublattices
- MaximalSubmodules
- MaximalTotallyIsotropicSubspace
- MaximalTotallySingularSubspace
- MaximalVertexFacetHeightMatrix
- MaximalZeroOneSolution
- Maximise
- Maximising
- Maximum
- GetMaximumMemoryUsage() : -> RngIntElt
- IsMaximumDimensional(C) : TorCon -> BoolElt
- IsMaximumDistanceSeparable(C) : Code -> BoolElt
- Maximum(a, b) : RngElt, RngElt -> RngElt
- Maximum(S) : SeqEnum -> Elt, RngIntElt
- Maximum(S) : SetIndx -> Elt, RngIntElt
- Maximum(Q) : [RngIntElt] -> RngElt
- MaximumBettiDegree(M, i) : ModMPol, RngIntElt -> RngIntElt
- MaximumClique(G : parameters) : GrphUnd -> { GrphVert }
- MaximumDegree(G) : GrphDir -> RngIntElt, GrphVert
- MaximumDegree(G) : GrphMultDir -> RngIntElt, GrphVert
- MaximumDegree(G) : GrphMultUnd -> RngIntElt, GrphVert
- MaximumDegree(G) : GrphUnd -> RngIntElt, GrphVert
- MaximumDegree(f) : SeqEnum -> RngIntElt
- MaximumFlow(s, t : parameters) : GrphVert, GrphVert -> RngIntElt, SeqEnum
- MaximumFlow(Ss, Ts : parameters) : [ GrphVert ], [ GrphVert ] -> RngIntElt, SeqEnum
- MaximumInDegree(G) : GrphDir -> RngIntElt, GrphVert
- MaximumInDegree(G) : GrphMultDir -> RngIntElt, GrphVert
- MaximumIndependentSet(G: parameters) : GrphUnd -> { GrphVert }
- MaximumMatching(G) : GrphUnd -> [ { GrphEdge } ]
- MaximumMatching(G : parameters) : GrphMultUnd -> [ { GrphEdge rbrace ]
- MaximumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
- MaximumOutDegree(G) : GrphMultDir -> RngIntElt, GrphVert
- ResetMaximumMemoryUsage() : ->
- MaximumBettiDegree
- MaximumClique
- MaximumDegree
- MaximumFlow
- MaximumInDegree
- MaximumIndependentSet
- MaximumMatching
- MaximumOutDegree
- Maxindeg
- MaxMatching
- maxmatching
- maxmin
- maxmin-submodules
- MaxNorm
- Maxoutdeg
- MaxParabolics
- Mc
- mceliece
- McElieceEtAlAsymptoticBound
- McEliecesAttack
- MCPolynomials
- MDS
- mds
- mds-codes
- MDSCode
- Mean
V2.28, 13 July 2023