@InProceedings{willard:DagSemProc.09441.4,
  author =	{Willard, Ross},
  title =	{{PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9441},
  editor =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09441.4},
  URN =		{urn:nbn:de:0030-drops-23680},
  doi =		{10.4230/DagSemProc.09441.4},
  annote =	{Keywords: Primitive positive formula, definability, complexity}
}