scientific article; zbMATH DE number 6914956
From MaRDI portal
Publication:4578331
DOI10.4086/cjtcs.2018.002zbMath1398.68493arXiv1610.07100OpenAlexW4235268052MaRDI QIDQ4578331
Publication date: 8 August 2018
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07100
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- New exact algorithms for the 2-constraint satisfaction problem
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Two-dimensional weight-constrained codes through enumeration bounds
- Exact Max 2-Sat: Easier and Faster
- On a lemma of Littlewood and Offord
This page was built for publication:
