Maximum Matching and Linear Programming in Fixed-Point Logic with Counting

We establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah [1], who asked w...

Celý popis

Podrobná bibliografia

Vydané v:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science s. 173 - 182
Hlavní autori:	Anderson, Matthew, Dawar, Anuj, Holm, Bjarki
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2013
Predmet:	Ellipsoids Encoding fixed-point logic with counting Linear programming maximum flow maximum matching minimum cut minimum odd cut Optimization Polynomials Vectors Vocabulary
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!