On the usefulness of linear modular arithmetic in constraint programming
type: Item
instance of: scholarly article
title: On the usefulness of linear modular arithmetic in constraint programming
DOI: 10.1007/978-3-030-78230-6_16
author: Gilles Pesant
author: Kuldeep S. Meel
author: Mahshid Mohammadalitajrishi
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7493633
MaRDI profile type: Publication
full work available at URL: 978-3-030-78230-6 16
OpenAlex ID: W3170003207
cites work: An Alternative to SAT-Based Approaches for Bit-Vectors
cites work: Global constraint catalogue: past, present and future
cites work: Sharpening constraint programming approaches for bit-vector theory
cites work: Q5740444
cites work: Sparse Hashing for Scalable Approximate Model Counting
cites work: Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
cites work: A dynamic programming approach for consistency and propagation for knapsack constraints
cites work: The Complexity of Enumeration and Reliability Problems
description: scientific article; zbMATH DE number 7493633