×

Found 1,244 Documents (Results 1–100)

Dynamics, information and complexity in quantum systems. 2nd edition. (English) Zbl 1531.81002

Theoretical and Mathematical Physics (Cham). Cham: Springer (ISBN 978-3-031-34247-9/hbk; 978-3-031-34250-9/pbk; 978-3-031-34248-6/ebook). xiv, 618 p. (2023).
PDFBibTeX XMLCite
Full Text: DOI

Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability. (English) Zbl 07691317

Ciabattoni, Agata (ed.) et al., Logic, language, information, and computation. 28th international workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13468, 88-104 (2022).
MSC:  03B70
PDFBibTeX XMLCite
Full Text: DOI

Top tree compression of tries. (English) Zbl 1518.68071

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 4, 18 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

From mathesis universalis to provability, computability, and constructivity. (English) Zbl 1469.03113

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 203-234 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. (English) Zbl 1425.68238

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 134-145 (2019).
MSC:  68Q45 68Q12 81P68
PDFBibTeX XMLCite
Full Text: DOI arXiv

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications. (English) Zbl 1497.68211

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 19, 18 p. (2018).
MSC:  68Q10 68T42
PDFBibTeX XMLCite
Full Text: DOI

Polynomial running times for polynomial-time oracle machines. (English) Zbl 1434.03117

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 23, 18 p. (2017).
MSC:  03D78 68Q15 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

A hierarchy for BPP//log\(\star\) based on counting calls to an oracle. (English) Zbl 1396.68049

Adamatzky, Andrew (ed.), Emergent computation. A Festschrift for Selim G. Akl. Cham: Springer (ISBN 978-3-319-46375-9/hbk; 978-3-319-46376-6/ebook). Emergence, Complexity and Computation 24, 39-56 (2017).
MSC:  68Q15 68Q05 68Q87
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software