scientific article; zbMATH DE number 7804588
From MaRDI portal
Publication:6193828
zbMath1530.18029arXiv2107.01778MaRDI QIDQ6193828
Kei Kimura, Soichiro Fujii, Yuni Iwamasa
Publication date: 13 February 2024
Full work available at URL: https://arxiv.org/abs/2107.01778
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of universal algebra in computer science (08A70) 2-categories, bicategories, double categories (18N10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Free quantaloids
- On the algebraic structure of combinatorial problems
- Constraint programming and operations research
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- A general Galois theory for operations and relations in arbitrary categories
- Inter-universal Teichmüller theory. I: Construction of Hodge theaters
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- On the Structure of Polynomial Time Reducibility
- Metric spaces, generalized logic, and closed categories
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Semiring-based constraint satisfaction and optimization
- Complexity Dichotomies for Counting Problems
- The Complexity of Valued Constraint Satisfaction Problems
- Constraint Satisfaction Problems over Numeric Domains
- An Algebraic Approach to Valued Constraint Satisfaction
- A Proof of the CSP Dichotomy Conjecture
- Classifying the Complexity of Constraints Using Finite Algebras
- An Algebraic Theory of Complexity for Discrete Optimization
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- Linear programming. Foundations and extensions
- Convergence and efficiency of subgradient methods for quasiconvex minimization
This page was built for publication:
