Two Applications of Inductive Counting for Complementation Problems
- 1 June 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (3), 559-578
- https://doi.org/10.1137/0218038
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Collapsing oracle hierarchies, census functions and logarithmically many queriesPublished by Springer Nature ,2006
- On probabilistic time and spacePublished by Springer Nature ,2005
- Short monotone formulae for the majority functionJournal of Algorithms, 1984
- Space-bounded hierarchies and probabilistic computationsJournal of Computer and System Sciences, 1984
- Randomised algorithmsDiscrete Applied Mathematics, 1983
- AlternationJournal of the ACM, 1981
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- A Theorem on Boolean MatricesJournal of the ACM, 1962