Nigmatullin, R. G. Linear lower bounds of the complexity and their mathematical models. (Russian) Zbl 0767.94026 Mathematical problems in computation theory, Proc. 26th semester, Warsaw/ Poland 1985, Banach Cent. Publ. 21, 531-542 (1988). Reviewer: J.Hromkovič (Paderborn) MSC: 94C10 68Q25 03D15 PDFBibTeX XMLCite \textit{R. G. Nigmatullin}, Banach Cent. Publ. 21, 531--542 (1988; Zbl 0767.94026)
Nigmatullin, R. G. Exponential influence of the constant zero on the complexity of computation of universal polynomials. (Russian) Zbl 0603.68043 Veroyatn. Metody Kibern. 21, 75-85 (1985). Reviewer: A.Slisenko MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{R. G. Nigmatullin}, Veroyatn. Metody Kibern. 21, 75--85 (1985; Zbl 0603.68043) Full Text: EuDML
Nigmatullin, R. G. Are lower bounds on the complexity lower bounds for universal circuits? (English) Zbl 0573.94014 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 331-340 (1985). MSC: 94C10 68Q25 68Q05 PDFBibTeX XML
Nigmatullin, R. G. The problem of lower bounds of complexity and the theory of NP- completeness. (Russian) Zbl 0478.68037 Izv. Vyssh. Uchebn. Zaved., Mat. 1981, No. 5(228), 17-25 (1981). MSC: 68Q25 68-02 PDFBibTeX XMLCite \textit{R. G. Nigmatullin}, Izv. Vyssh. Uchebn. Zaved., Mat. 1981, No. 5(228), 17--25 (1981; Zbl 0478.68037)