When Do Fixed Point Logics Capture Complexity Classes?
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

Anil Seth
When Do Fixed Point Logics Capture Complexity Classes?
LICS, 1995.

LICS 1995
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LICS-1995-Seth,
	author        = "Anil Seth",
	booktitle     = "{Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science}",
	doi           = "10.1109/LICS.1995.523270",
	isbn          = "0-8186-7050-9",
	pages         = "353--363",
	publisher     = "{IEEE Computer Society}",
	title         = "{When Do Fixed Point Logics Capture Complexity Classes?}",
	year          = 1995,
}

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.