Tamio-Vesa Nakajima

Tamio-Vesa Nakajima

Doctoral Student

Student, Trinity College

Wolfson Building, Parks Road, Oxford OX1 3QD

Themes:

• Algorithms and Complexity Theory

Biography

More information can be found on my personal webpage.

Selected Publications

View AllManage publications

• Linearly Ordered Colourings of Hypergraphs

  Tamio−Vesa Nakajima and Stanislav Živný

  In ACM Trans. Comput. Theory. Vol. 14. No. 3–4. February, 2023.

  Details about Linearly Ordered Colourings of Hypergraphs | BibTeX data for Linearly Ordered Colourings of Hypergraphs | DOI (10.1145/3570909) | Link to Linearly Ordered Colourings of Hypergraphs

• On the complexity of the approximate hypergraph homomorphism problem

  Lorenzo Ciardo‚ Marcin Kozik‚ Andrei Krokhin‚ Tamio−Vesa Nakajima and Stanislav Živǹy

  In arXiv preprint arXiv:2302.03456. 2023.

  Details about On the complexity of the approximate hypergraph homomorphism problem | BibTeX data for On the complexity of the approximate hypergraph homomorphism problem | DOI (10.48550/arXiv.2302.03456)

• Boolean symmetric vs. functional PCSP dichotomy

  Tamio−Vesa Nakajima and Stanislav Živný

  In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Pages 1−12. 2023.

  Details about Boolean symmetric vs. functional PCSP dichotomy | BibTeX data for Boolean symmetric vs. functional PCSP dichotomy | DOI (10.1109/LICS56636.2023.10175746)

Projects

• NAASP

Supervisor