Part of the Lecture Notes in Computer Science book series (LNCS, volume 1862)
Choiceless Polynomial Time Computation and the Zero-One Law
KeywordsActive Element Turing Machine Free Variable Function Symbol Input Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 4.Béla Bollobás, Random graphs, Academic Press, 1985.Google Scholar
- 5.Heinz-Dieter Ebbinghaus and Jörg Flum, Finite Model Theory, Springer-Verlag (1995).Google Scholar
- 6.Yuri Gurevich, Evolving algebras 1993: Lipari guide, in Specification and Validation Methods, ed. E. Börger, Oxford University Press (1995) pp. 9–36. See also the May 1997 draft of the ASM guide, Tech Report CSE-TR-336-97, EECS Dept., Univ. of Michigan, 1997. Found at http://www.eecs.umich.edu/gasm/.
- 7.Saharon Shelah, Choiceless polynomial time logic: inability to express [paper number 634], these proceedings.Google Scholar
© Springer-Verlag Berlin Heidelberg 2000