Lower Bounds for Existential Pebble Games and k-Consistency Tests

The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The winner of the existential k-pebble game on two given finite structures can be determined in time O(n2k) by dynamic programming on the graph...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 9, Issue 4
Hlavný autor:	Berkholz, Christoph
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 08.10.2013
Predmet:	computer science - computational complexity computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!