Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Wied Pakusa, Svenja Schalthöfer, Erkal Selman
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time
CSL, 2016.

CSL 2016
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CSL-2016-PakusaSS,
	author        = "Wied Pakusa and Svenja Schalthöfer and Erkal Selman",
	booktitle     = "{Proceedings of the 25th EACSL Annual Conference on Computer Science Logic}",
	doi           = "10.4230/LIPIcs.CSL.2016.19",
	isbn          = "978-3-95977-022-4",
	pages         = "17",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	title         = "{Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time}",
	year          = 2016,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.