Jukna, Stasys Boolean function complexity. Advances and frontiers. (English) Zbl 1235.94005 Algorithms and Combinatorics 27. Berlin: Springer (ISBN 978-3-642-24507-7/hbk; 978-3-642-24508-4/ebook). xv, 617 p. (2012). Reviewer: Ioan Tomescu (Bucureşti) MSC: 94-02 94C10 03F20 68Q05 68Q17 68Q25 PDFBibTeX XMLCite \textit{S. Jukna}, Boolean function complexity. Advances and frontiers. Berlin: Springer (2012; Zbl 1235.94005) Full Text: DOI
Jukna, Stasys Combinatorics of monotone computations. (English) Zbl 0962.03030 Combinatorica 19, No. 1, 65-85 (1999). MSC: 03D15 68Q17 94C10 05D15 68R05 03F07 03B05 68Q05 PDFBibTeX XMLCite \textit{S. Jukna}, Combinatorica 19, No. 1, 65--85 (1999; Zbl 0962.03030) Full Text: DOI
Jukna, Stasys Exponential lower bounds for semantic resolution. (English) Zbl 0890.03032 Beame, Paul W. (ed.) et al., Proof complexity and feasible arithmetics. Papers from the DIMACS workshop, Rutgers, NJ, USA, April 21–24, 1996. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 163-172 (1998). MSC: 03F20 03B35 68R05 51E15 51E21 68Q15 03B05 PDFBibTeX XMLCite \textit{S. Jukna}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 163--172 (1998; Zbl 0890.03032)
Jukna, S. P. Lower bounds on the complexity of local circuits. (English) Zbl 0609.94018 Mathematical foundations of computer science, Proc. 12th Symp., Bratislava/Czech. 1986, Lect. Notes Comput. Sci. 233, 440-448 (1986). MSC: 94C10 68Q25 03D15 PDFBibTeX XML
Jukna, S. Succinct data representations and the complexity of computations. (English) Zbl 0601.03017 Theory of algorithms, Colloq. Pécs/Hung. 1984, Colloq. Math. Soc. János Bolyai 44, 271-282 (1986). MSC: 03D15 68Q25 68P05 03D60 PDFBibTeX XML
Jukna, S. Convolutional characterization of computability and complexity of computations. (English) Zbl 0601.03016 Theory of algorithms, Colloq. Pécs/Hung. 1984, Colloq. Math. Soc. János Bolyai 44, 251-270 (1986). MSC: 03D15 68Q25 03D60 68Q05 03D10 68W99 PDFBibTeX XML
Yukna, Stasis On the arithmetization of computations. (Russian. English summary) Zbl 0567.03015 Mat. Logika Primen. 3, 117-125 (1983). MSC: 03D15 03D10 PDFBibTeX XMLCite \textit{S. Yukna}, Mat. Logika Primen. 3, 117--125 (1983; Zbl 0567.03015)
Yukna, S. On a principle for obtaining lower estimates of arithmetical complexity. (Russian) Zbl 0516.03034 Mat. Logika Primen. 2, 108-112 (1982). MSC: 03F20 03D15 PDFBibTeX XMLCite \textit{S. Yukna}, Mat. Logika Primen. 2, 108--112 (1982; Zbl 0516.03034)
Yukna, S. Arithmetical representations of machine complexity classes. (Russian) Zbl 0515.68045 Mat. Logika Primen. 2, 92-107 (1982). MSC: 68Q25 03F20 03D15 PDFBibTeX XMLCite \textit{S. Yukna}, Mat. Logika Primen. 2, 92--107 (1982; Zbl 0515.68045)
Plyushkyavichyus, R. A.; Plyushkyavichene, A. Yu.; Sakalauskajte, Yu. V.; Yukna, S. P. On the logic of programs. (English. Russian original) Zbl 0444.68024 Cybernetics 15, 167-176 (1979); translation from Kibernetika 1979, No. 2, 12-19 (1979). MSC: 68Q65 68N01 03B60 03B25 68W99 PDFBibTeX XMLCite \textit{R. A. Plyushkyavichyus} et al., Cybernetics 15, 167--176 (1979; Zbl 0444.68024); translation from Kibernetika 1979, No. 2, 12--19 (1979)