scientific article; zbMATH DE number 6767523

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.110zbMath1375.68102arXiv1505.03424MaRDI QIDQ5351893

No author found.

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1505.03424

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

constraint satisfaction problemsbounded degreeadvantage over random

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Computing the Partition Function of a Polynomial on the Boolean Cube

This page was built for publication: