A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Y - Z

M

---

• MA
• MAC
• machine learning
• machines that take advice
• MacWilliams Theorems
• Mahaney
• majority
• Majority Accepting Mode
• majority function
• majority gate
• majority is stablest
• Mal'tsev operation
• malicious noise
• Malicious Parties
• malleable
• Malliavin calculus
• Malt'sev
• Maltsev operations
• Mann-Whitney test
• Mansour
• Mansour's Conjecture
• many-one completeness
• margin complexity
• market equilibria
• Market Equilibrium
• markov chain
• Markov Chain Monte Carlo
• Markov Chains
• Markov inequalities
• Markov Perfect Equilibrium
• Markov Processes
• Martin-Löf randomness
• martingale
• Martingale convergence
• martingales
• Mastermind
• Matchgate computation
• Matchgate identities
• matchgates
• matching
• matching autarky
• Matching polytope
• Matching Problem
• matching vector families
• matchings
• mathematical programming
• Matrices
• matrix
• Matrix completion
• matrix compression
• matrix factorization
• Matrix groups
• Matrix identities
• Matrix Inversion
• matrix multiplication
• matrix norms
• Matrix Powering
• matrix product
• Matrix Rank
• Matrix Regidity
• Matrix Rigidity
• Matrix Rigidty
• matrix scaling
• Matrix Spaces
• matrix-completion
• matroid freeness
• Matroid Intersection
• Matroid Parity
• matroids
• Max 2-Sat
• MAX 2SAT
• Max acyclic subgraph
• Max Bi-Clique
• max cut
• Max DICUT
• Max k-AllEqual
• Max k-CSP
• Max k-cut
• MAX NP
• MAX Problem
• MAX SNP
• Max SNP-hardness
• MAX-2-SAT
• MAX-2LIN
• MAX-2SAT
• MAX-3SAT
• MAX-BISECTION
• Max-Clique
• MAX-CSP
• MAX-CSP Problems
• Max-Cut
• max-k-csp
• MAX-SAT
• MAX-SNP Hardness
• Maximal Compression
• maximal constraint languages
• maximal independent set
• maximal-in-range
• Maximally Recoverable Codes
• Maximisation Class
• maximizing agreements
• Maximum Independent Set
• Maximum 3D-Matching
• Maximum Acyclic Subgraph
• Maximum Asymmetric Traveling Salesperson
• Maximum Compression
• Maximum Constraint Satisfaction
• Maximum Cut
• Maximum Cycle Decomposition
• maximum independent set
• maximum independent set problem
• Maximum Inner Product
• maximum likelihood
• maximum likelihood decoding
• maximum likelihood learning
• maximum matching
• maximum matchings
• Maximum Planar Satisfiability
• maximum rank matrix completion
• Maximum Satisfiability
• maximum weight subgraph
• MaxSAT
• MAXSAT problem
• mazes
• MCSP
• MDS codes
• mean-payoff games
• means
• measure
• measure 1 oracle set
• membership
• membership comparable
• membership queries
• membership query
• Memoization
• memorization
• memory checking
• Memory Contention
• memory restriction
• Merge Resolution
• merger
• mergers
• Merkle puzzles
• Merkle Trees
• Merlin-Arthur
• Merlin-Arthur classes
• Merlin-Arthur communication
• Merlin-Arthur communication complexity
• Merlin-Arthur games
• Merlin-Arthur proofs
• Merlin-Arthur protocol
• Mersenne numbers
• mesh of buses
• Message passing algorithms
• meta-algorithms
• meta-complexity
• Metamathematics
• metric embeddings
• Metric Instances
• metric k-center
• Metric space
• Metric Spaces
• Metric TSP
• Metrics
• Metropolis algorithm
• Metze
• middle bit
• MIN 2CNF Deletion
• MIN DOMINATING SET-hard problems
• Min Entropy
• MIN-2SAT
• MIN-BISECTION
• MIN-CLUSTERING
• min-cut
• MIN-Ek-LIN2
• Min-entropy
• MIN-kSAT
• MIN-LIN2
• min-max theorem
• Min-rank
• Min-Wise Independence
• Minimal Circuit Size Problem (MCSP)
• Minimal Cutsets
• Minimal entailment
• minimal hardness assumptions
• minimal sufficient statistic
• minimal uncolorability
• minimal unsatisfiability
• minimal unsatisfiable formulas
• minimal unsatisfiable ltl formulas
• minimal weights
• minimally unsatisfiable clause-sets
• minimally unsatisfiable set
• minimax
• minimizing disagreement problem
• Minimum Bisection
• Minimum Circuit Size
• Minimum Circuit Size Problem
• Minimum Circuit Size Problem (MCSP)
• Minimum Constraint Satisfaction
• Minimum Cost Scheduling
• Minimum distance
• minimum distance problem
• Minimum Equivalent Digraph
• Minimum Graph Homomorphism
• Minimum Redundancy Length Limited Codes
• minimum spanning trees
• Minimum Unsatisfiability of Linear Equations
• minmax value
• MinMonSAT
• Minor-free graphs
• minority-majority operation
• MIS
• missing string
• mistake-bound
• mitoticity
• mixed discriminants
• mixed instance
• mixed state
• mixed volume
• mixed-integer rounding
• mixing
• mixing time
• mixture models
• mixtures of Gaussians
• MKTP
• mobile computing
• mod function
• MOD gate
• MOD gates
• Mod gates, composite moduli, exponential sums
• Mod m
• MOD6PH
• model checking
• model counting
• Model separation
• model theory
• Model-Checking Problems
• Model-counting Induction by Claim Extension
• models of computation
• ModPH
• Modular Acception Modes
• modular arithmeticinteger multiplication
• modular circuits
• modular counting
• modular exponentiation
• Modular Square Roots
• modular sums
• module-morphism
• modulo
• Modulo based computation
• modulo, prime-power
• modulus
• MOD_k-GAP
• molecular computing
• moments
• monadic second-order logic
• monochromatic rectangle
• monoid
• Monoids
• monomial
• monomial space
• monotone
• monotone arithmetic circuit
• Monotone Arithmetic Circuits
• monotone Boolean circuit
• monotone Boolean function
• Monotone Calculus
• monotone circuit
• monotone circuit complexity
• Monotone circuits
• monotone complexity
• monotone computation
• Monotone DNF
• monotone formulas
• monotone functions
• Monotone Graph Properties
• monotone interpolation
• Monotone Junta
• monotone multilinear Boolean circuit
• Monotone Planar Circuit
• monotone planar circuits
• monotone predicate
• Monotone projection
• Monotone Properties
• monotone rank
• Monotone VPSPACE
• Monotonicity
• Monotonicity testing
• morphism
• MPC
• MST problem
• mulitlinear circuits
• Multi Commodity Flow
• multi-arm bandit problems
• multi-armed bandit
• multi-criteria traveling salesman problem
• multi-dimensional mechanisms
• multi-linear circuits
• multi-linear functions
• Multi-Objective Optimization
• multi-party communication
• multi-party communication complexity
• multi-party computation
• multi-party secure computation
• multi-player games
• multi-product pricing
• multi-prover
• multi-prover interactive proofs
• multi-source
• Multicast
• Multiclass learning
• multicollision resistance
• Multicommodity flow
• Multicommodity flows
• Multicut, Unique Games
• multidimensional setting
• multihead automata
• Multilayered Label Cover
• multilinear
• multilinear arithmetic formulas
• Multilinear Circuit
• multilinear circuits
• multilinear formula size
• Multilinear Formulas
• multilinear functions
• multilinear polynomial
• multilinear proofs
• multinomial distributions
• multiobjective optimization
• Multiobjective Optimization Problems
• multipartition communication complexity
• multiparty
• Multiparty communication
• multiparty communication complexity
• multiparty communication, information complexity, direct sum, amortized complexity
• multiparty computation
• Multiparty Computation Functionalities
• multiparty protocols
• Multiphase Conjecture
• multiple addition
• multiple passes
• Multiple Product
• multiplexer relation
• multiplexor relation
• multiplication
• multiplication codes
• multiplications
• multiplicative complexity
• multiplicative weights
• Multiplicity Automata
• multiplicity codes
• multiprocessor networks
• multiprover games
• multiprover interactive proofs
• Multiselection
• multisource information theory
• multivalued functions
• multivariable calculus
• multivariate multipoint evaluation
• Multivariate Polynomial
• Multivariate Polynomial Factoring
• Multivariate Polynomial Factorization
• Multivariate Polynomial Reconstruction
• multivariate polynomials
• Multivariate Polynomials Factorization
• Mutilated Chessboard
• mutual information
• Myerson
• myopic and drunk algorithms

---

ISSN 1433-8092 | Imprint