Biman Roy

According to our database, Biman Roy authored at least 9 papers between 2016 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases.

Victor Lagerkvist, Biman Roy

J. Multiple Valued Log. Soft Comput., 2022

2021

Fine-Grained Time Complexity of Constraint Satisfaction Problems.

Peter Jonsson, Victor Lagerkvist, Biman Roy

ACM Trans. Comput. Theory, 2021

Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem.

Victor Lagerkvist, Biman Roy

J. Comput. Syst. Sci., 2021

2020

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems.

Biman Roy

PhD thesis, 2020

2019

The Inclusion Structure of Boolean Weak Bases.

Victor Lagerkvist, Biman Roy

Proceedings of the 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), 2019

2017

Time Complexity of Constraint Satisfaction via Universal Algebra.

Peter Jonsson, Victor Lagerkvist, Biman Roy

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations.

Miguel Couceiro, Lucien Haddad, Victor Lagerqvist, Biman Roy

Proceedings of the 47th IEEE International Symposium on Multiple-Valued Logic, 2017

A Dichotomy Theorem for the Inverse Satisfiability Problem.

Victor Lagerkvist, Biman Roy

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT.

Victor Lagerkvist, Biman Roy

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016