×

Found 16 Documents (Results 1–16)

On the width of regular classes of finite structures. (English) Zbl 07178967

Fontaine, Pascal (ed.), Automated deduction – CADE 27. 27th international conference on automated deduction, Natal, Brazil, August 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11716, 18-34 (2019).
MSC:  03B35 68V15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Implicit computation of maximum bipartite matchings by sublinear functional operations. (English) Zbl 1354.05128

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 473-486 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Larger lower bounds on the OBDD complexity of integer multiplication. (English) Zbl 1234.68085

Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 212-223 (2009).
MSC:  68P05 68Q17
PDFBibTeX XMLCite
Full Text: DOI

On the OBDD complexity of threshold functions and the variable ordering problem (extended abstract). (English) Zbl 1206.68100

Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 129-140 (2009).
MSC:  68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software