Ablayev, Farid; Karpinski, Marek A lower bound for integer multiplication on randomized ordered read-once branching programs. (English) Zbl 1059.68045 Inf. Comput. 186, No. 1, 78-89 (2003). MSC: 68Q17 68Q10 68W20 PDFBibTeX XMLCite \textit{F. Ablayev} and \textit{M. Karpinski}, Inf. Comput. 186, No. 1, 78--89 (2003; Zbl 1059.68045) Full Text: DOI
Ablayev, F.; Karpinski, M.; Mubarakzjanov, R. On BPP versus \(NP\cup coNP\) for ordered read-once branching programs. (English) Zbl 0972.68091 Theor. Comput. Sci. 264, No. 1, 127-137 (2001). MSC: 68Q15 PDFBibTeX XMLCite \textit{F. Ablayev} et al., Theor. Comput. Sci. 264, No. 1, 127--137 (2001; Zbl 0972.68091) Full Text: DOI
Karpinski, Marek On the computation power of randomized branching programs. (English) Zbl 0922.68063 Freivalds, Rūsiņš (ed.), Randomized algorithms. Proceedings of the international workshop, Brno, Czech Republic, August 27–28, 1998. Trier: Electronic Colloquium on Computational Complexity (ECCC), Lecture Notes Series of ECCC. (1998). MSC: 68Q15 PDFBibTeX XML Full Text: Link