×

Found 31 Documents (Results 1–31)

Deterministic coloring of a family of complexes. (English. Russian original) Zbl 07794021

J. Math. Sci., New York 275, No. 4, 403-501 (2023); translation from Fundam. Prikl. Mat. 24, No. 2, 37-180 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Logical complexity of induced subgraph isomorphism for certain families of graphs. (English. Russian original) Zbl 1468.05189

Sb. Math. 212, No. 4, 517-530 (2021); translation from Mat. Sb. 212, No. 4, 76-90 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Effectiveness of Hindman’s theorem for bounded sums. (English) Zbl 1480.03005

Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 10010, 134-142 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quasiperiodicity and non-computability in tilings. (English) Zbl 1465.68085

Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9234, 218-230 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Constructing new aperiodic self-simulating tile sets. (English) Zbl 1268.03056

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 300-309 (2009).
MSC:  03D35 05B45 68Q05
PDFBibTeX XMLCite
Full Text: DOI

Fixed point and aperiodic tilings. (English) Zbl 1161.68033

Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 276-288 (2008).
MSC:  68Q80 05B45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two-by-two substitution systems and the undecidability of the domino problem. (English) Zbl 1142.03357

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 476-485 (2008).
MSC:  03D35 05B45
PDFBibTeX XMLCite
Full Text: DOI

A topological study of tilings. (English) Zbl 1140.68067

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 375-387 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field