×

Found 12 Documents (Results 1–12)

Succinct algebraic branching programs characterizing non-uniform complexity classes. (English) Zbl 1342.68137

Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 205-216 (2011).
MSC:  68Q15 68P05
PDFBibTeX XMLCite
Full Text: DOI

Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria. (English) Zbl 1508.68121

Chlebus, Bogdan S. (ed.) et al., Fundamentals of computation theory. 11th international symposium, FCT ’97, Jagiellonian Univ., Kraków, Poland, September 1–3, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1279, 233-244 (1997).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software