Fischer, Michael J.; Meyer, Albert R.; Paterson, Michael S. Omega(n log n) lower bounds on length of Boolean formulas. (English) Zbl 0488.94036 SIAM J. Comput. 11, 416-427 (1982). MSC: 94C10 68Q25 PDFBibTeX XMLCite \textit{M. J. Fischer} et al., SIAM J. Comput. 11, 416--427 (1982; Zbl 0488.94036) Full Text: DOI
Miller, Raymond E. (ed.) [Meyer, Albert R.; Parikh, Rohit; Reif, J. H.; Mirkowska, Grazyna; Pratt, V. R.; Ukkonen, Esko; Plaisted, David A.; DeMillo, R. A.; Lipton, R. J.; Joseph, D.; Young, Paul; Lynch, N. A.; Angluin, D.; Toueg, S.; Brown, Donna J.; Strong, H. R.; Sadri, F.; Ullman, Jeffrey D.; Fagin, Ronald; Overmars, M. H.; van Leeuwen, Jan; Chazelle, Bernard; Dobkin, D. P.; Guibas, L. J.; Yao, Frances F.; Tompa, Martin; Fischer, Michael J.; Paterson, Michael S.; Brent, R. P.; Kung, H. T.; Storer, J. A.; Cypher, A.; Lichtenstein, David; Miller, Gary; Filotti, I. S.; Mayer, Jack N.; Hoffmann, C. M.; Kannan, R.; Heintz, J.; Schnorr, C. P.; Ibarra, O. H.; Leininger, B. S.; Ehrig, H.; Mahr, B.; Borodin, A.; Cook, S.; Karp, R. M.; Hong, Jia-wei; Yap, C. K.; Carlson, D. A.; Savage, J. E.; Ja’Ja’, Joseph; Pippenger, N.; Paul, W. J.; Seiferas, J. I.; Simon, J.; Tarjan, R. E.; Bloniarz, P.; Spirakis, P.; Supowit, K. J.; Reingold, E. M.; Frederickson, G. N.; Johnson, D. B.; Lloyd, E. L.] Conference proceedings of the twelfth annual ACM symposium on theory of computing, held at Los Angeles, California, April 28-30, 1980. (English) Zbl 0476.68003 Sponsored by the Association for Computing Machinery, Special Interest Group on Automata and Computability Theory, with the Cooperation of the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing and Computer Science Department, University of Southern California, Los Angeles, California. New York: The Association for Computing Machinery, Inc. V, 447 p. $ 14.00; $ 17.00 (1980). MSC: 68-06 00Bxx PDFBibTeX XML
Seiferas, Joel I.; Fischer, Michael J.; Meyer, Albert R. Separating nondeterministic time complexity classes. (English) Zbl 0366.68038 J. Assoc. Comput. Mach. 25, 146-167 (1978). MSC: 68Q25 68Q45 03D10 PDFBibTeX XMLCite \textit{J. I. Seiferas} et al., J. Assoc. Comput. Mach. 25, 146--167 (1978; Zbl 0366.68038) Full Text: DOI
Paterson, Michael S.; Fischer, Michael J.; Meyer, Albert R. An improved overlap argument for on-line multiplication. (Russian) Zbl 0408.68043 Kibern. Sb., Nov. Ser. 14, 78-94 (1977). MSC: 68Q25 68Q05 PDFBibTeX XMLCite \textit{M. S. Paterson} et al., Kibern. Sb., Nov. Ser. 14, 78--94 (1977; Zbl 0408.68043)
Bloniarz, P. A.; Fischer, M. J.; Meyer, A. R. A note on the average time to compute transitive closures. (English) Zbl 0363.68055 Automata, languages and programming, 3rd int. Colloq. Edinburgh 1976, 425-434 (1976). MSC: 68W99 68Q25 68N01 PDFBibTeX XML
Lynch, Nancy Ann; Meyer, Albert R.; Fischer, Michael J. Relativization of the theory of computational complexity. (English) Zbl 0353.68059 Trans. Am. Math. Soc. 220, 243-287 (1976). MSC: 68Q25 03D10 03D20 03D55 PDFBibTeX XMLCite \textit{N. A. Lynch} et al., Trans. Am. Math. Soc. 220, 243--287 (1976; Zbl 0353.68059) Full Text: DOI
Fischer, Michael J.; Meyer, Albert R.; Paterson, Michael S. Lower bounds on the size of Boolean formulas: Preliminary report. (English) Zbl 0381.94028 Proc. 7th ann. ACM Symp. Theory Comput., Albuquerque 1975, 37-44 (1975). MSC: 94C10 PDFBibTeX XML
Paterson, Michael S.; Fischer, Michael J.; Meyer, Albert R. An improved overlap argument for on-line multiplication. (English) Zbl 0301.68059 Complexity of Comput., Proc. Symp. appl. Math., New York City 1973, 97-111 (1974). MSC: 68Q25 PDFBibTeX XML