Biman Roy

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
$\mathbb{A}^1$-homotopy type of $\mathbb{A}^2 \setminus \{(0, 0)\}$ Advances in Mathematics	2026-03-02	Paper
$ \mathbb{A}^1$-connected components and characterisation of $\mathbb{A}^2$ Journal für die Reine und Angewandte Mathematik	2024-02-12	Paper
C-maximal strong partial clones and the inclusion structure of Boolean weak bases	2022-06-03	Paper
Fine-grained time complexity of constraint satisfaction problems ACM Transactions on Computation Theory	2022-03-14	Paper
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem Journal of Computer and System Sciences	2021-02-02	Paper
A dichotomy theorem for the inverse satisfiability problem	2020-11-25	Paper
Time complexity of constraint satisfaction via universal algebra (available as arXiv preprint)	2020-05-26	Paper
A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT	2018-03-21	Paper
$\mathbb{A}^1$-homotopy type of $\mathbb{A}^2 \setminus \left\{(0,0) \right\}$ (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Biman Roy

Publication	Date of Publication	Type
\(\mathbb{A}^1\)-homotopy type of \(\mathbb{A}^2 \setminus \{(0, 0)\}\) Advances in Mathematics	2026-03-02	Paper
\( \mathbb{A}^1\)-connected components and characterisation of \(\mathbb{A}^2\) Journal für die Reine und Angewandte Mathematik	2024-02-12	Paper
C-maximal strong partial clones and the inclusion structure of Boolean weak bases	2022-06-03	Paper
Fine-grained time complexity of constraint satisfaction problems ACM Transactions on Computation Theory	2022-03-14	Paper
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem Journal of Computer and System Sciences	2021-02-02	Paper
A dichotomy theorem for the inverse satisfiability problem	2020-11-25	Paper
Time complexity of constraint satisfaction via universal algebra (available as arXiv preprint)	2020-05-26	Paper
A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT	2018-03-21	Paper
$\mathbb{A}^1$-homotopy type of $\mathbb{A}^2 \setminus \left\{(0,0) \right\}$ (available as arXiv preprint)	N/A	Paper