Back to Results
First PageMeta Content
Datalog


CSPs with near-unanimity polymorphisms are solvable by linear Datalog Marcin Kozik joint work with Libor Barto and Ross Willard Theoretical Computer Science Jagiellonian University
Add to Reading List

Document Date: 2011-08-15 11:19:55

Open Document

File Size: 647,77 KB

Share Result on Facebook

Facility

Datalog Fields Institute / Poland Fields Institute / /

Organization

Poland Fields Institute / Datalog Fields Institute / Jagiellonian University / /

Person

Ross Willard Theoretical / /

ProgrammingLanguage

Datalog / /

SocialTag