Previous article Full AccessErratum: Two Applications of Indctive Counting for Complementation ProblemsAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and Martin TompaAllan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and Martin Tompahttps://doi.org/10.1137/0218084PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Erratum: Two Applications of Indctive Counting for Complementation Problems." SIAM Journal on Computing, 18(6), p. 1283[1] Allan Borodin, , Stephen A. Cook, , Patrick W. Dymond, , Walter L. Ruzzo and , Martin Tompa, Two applications of inductive counting for complementation problems, SIAM J. Comput., 18 (1989), 559–578 10.1137/0218038 90k:68049a 0678.68031 LinkISIGoogle Scholar[2] John Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput., 6 (1977), 675–695 10.1137/0206049 57:4616 0366.02024 LinkISIGoogle Scholar[3] Hermann Jung, On probabilistic time and spaceAutomata, languages and programming (Nafplion, 1985), Lecture Notes in Comput. Sci., Vol. 194, Springer, Berlin, 1985, 310–317 87b:68039 0599.68043 CrossrefGoogle Scholar Previous article FiguresRelatedReferencesCited byDetails Dual VP Classes23 September 2016 | computational complexity, Vol. 26, No. 3 Cross Ref Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages Cross Ref Computational Complexity Cross Ref Trading Space for Time in Undirected s-t ConnectivityAndrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, and Eli Upfal31 July 2006 | SIAM Journal on Computing, Vol. 23, No. 2AbstractPDF (1266 KB)My favorite ten complexity theorems of the past decade1 June 2005 Cross Ref Lower bounds on the length of universal traversal sequencesJournal of Computer and System Sciences, Vol. 45, No. 2 Cross Ref A very hard log space counting class Cross Ref Volume 18, Issue 6| 1989SIAM Journal on Computing History Submitted:03 August 1989Accepted:30 August 1989Published online:13 July 2006 InformationCopyright © 1989 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0218084Article page range:pp. 1283-1283ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics