Amanote Research
Register
Sign In
Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
Linköping Studies in Science and Technology. Dissertations
doi 10.3384/diss.diva-164157
Full Text
Open PDF
Abstract
Available in
full text
Date
April 23, 2020
Authors
Biman Roy
Publisher
Linköping University Electronic Press
Related search
The Resolution Complexity of Random Constraint Satisfaction Problems
SIAM Journal on Computing
Mathematics
Computer Science
Solving Partial Constraint Satisfaction Problems With Tree Decomposition
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns
Distributed Partial Constraint Satisfaction Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Sticky Brownian Rounding and Its Applications to Constraint Satisfaction Problems
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Mathematics
Computer Science
On Some Fine-Grained Questions in Algorithms and Complexity
The Complexity of Satisfaction Problems in Reverse Mathematics
Computability
Theoretical Computer Science
Computational Theory
Computer Science Applications
Artificial Intelligence
Mathematics
Constraint Satisfaction Problems With Infinite Templates
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
