Nicholas Pippenger
Michael J. Fischer
- 1 COOK, S A, AND AANDERAA, S O On the minimum computation time of functions Trans AMS 142 (Aug 1969), 291-314Google Scholar
- 2 FISCHER, P.C, MEYER, A R, AND ROSENBERG, A L Real-t~me s~mulatton of mult~head tape units J A CM 19, 4 (Oct 1972), 590-607 Google Scholar
- 3 HENNIE, F C On-line Turlng machine computations IEEE Trans EC 15, 1 (Feb 1966), 34--44Google Scholar
- 4 HENNIE, F C, AND STEARNS, R E Two-tape simulation of multltape Turmg machines J ,4CM 13, 4 (Oct 1966), 533-546 Google Scholar
- 5 LEONG, B, AND SEIFERAS, J New real-time simulations of multthead tape units Proc 9th Annual ACM Symp Theory of Comptng, Boulder, Colo, May 1977, pp 239-248 Google Scholar
- 6 MULLER, D E Complexity tn electromc swltchmg circuits IRE Tram EC 5, 1 (March 1956), 15-19Google Scholar
- 7 PATERSON, M S, FISCHER, M J, AND MEYER, A R An improved overlap argument for on-hne mult~phcatlon SIA M-A MS Proc 7 (1974), 97-111Google Scholar
- 8 SAVAOE, J E Computational work and time on finite machines J A CM 19, 4 (Oct 1972), 660-674 Google Scholar
- 9 SCHNORR, C P The network complextty and the Turmg machine complextty of fimte funcUons Acta Informatlca 7 (1976), 95-107Google Scholar
- 10 STOSS, H-J Zwel-band Simulation von Turmgmaschmen Computing 7 (1971), 222-235Google Scholar
- 11 TURING, A M On computable numbers, wRh an apphcatlon to the Entschetdungsproblem Proc London Math Soc (2) 42 (1936), 230-265, correcttons 43 (1937), 544-546Google Scholar
Index Terms
- Relations Among Complexity Measures
Recommendations
Scenario-based analysis for discovering relations among interestingness measures
Graphical abstractDisplay Omitted
Highlights- Our scenario-based approach characterizes 61 measures and their relationship.
- A ...
AbstractMany interestingness measures have been proposed for mining meaningful association rules among two events in the form of A → B, but their characteristics and semantic similarity relations have not been comprehensively investigated. ...
Entropic measures, Markov information sources and complexity
The concept of entropy plays a major part in communication theory. The Shannon entropy is a measure of uncertainty with respect to a priori probability distribution. In algorithmic information theory the information content of a message is measured in ...
Rough relations, neighborhood relations, and granular computing
RSKT'11: Proceedings of the 6th international conference on Rough sets and knowledge technologyBased on formal relationships in Pansystems, this paper discusses the notion of indistinguishability relations among some order pairs in a binary relation and introduces rough relations. A rough relation is a generalization of a rough set from a new ...
Comments