Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
Matthew AndersonAnuj DawarBjarki HolmPublished in: CoRR (2013)
Keyphrases
- fixed point
- maximum matching
- linear programming
- bipartite graph
- stable set
- linear program
- floating point
- dynamical systems
- sufficient conditions
- belief propagation
- dynamic programming
- policy iteration
- np hard
- variational inequalities
- nonlinear programming
- objective function
- primal dual
- graphical models
- np complete
- bayesian networks
- upper bound
- constraint databases
- optimal solution