Fetching the paper…
Reading the bibliography…
Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems.
Coverings of bipartite graphs
Andrew L Dulmage and Nathan S Mendelsohn · 1958
Earlier work this paper cites.
Paths, trees, and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
Depth-first search and linear graph algorithms
Robert Tarjan · 1972
Earlier work this paper cites.
An n 5 / 2 n^{5/2} algorithm for maximum matchings in bipartite graphs
John E Hopcroft and Richard M Karp · 1973
Earlier work this paper cites.
Graphs and hypergraphs
Claude Berge · 1973
Earlier work this paper cites.
Consistency in networks of relations
Alan K Mackworth · 1977
Earlier work this paper cites.
Graph Theory with Applications
J.A. Bondy and U.S.R. Murty · 1977
Earlier work this paper cites.
An O( | V | | E | \sqrt{|V|}|E| ) algorithm for finding maximum matching in general graphs
Silvio Micali and Vijay V Vazirani · 1980
Earlier work this paper cites.
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Oscar H Ibarra and Shlomo Moran · 1981
Earlier work this paper cites.
Computing a maximum cardinality matching in a bipartite graph in time O ( n 1.5 m log n ) O(n^{1.5}m\log n)
Helmut Alt, Norbert Blum, Kurt Mehlhorn, and Markus Paul · 1991
Earlier work this paper cites.
A filtering algorithm for constraints of difference in CSPs
Jean-Charles Régin · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
A quantum algorithm for finding the minimum
Christoph Dürr and Peter Høyer · 1996
Earlier work this paper cites.
Integer programming , volume 52
Laurence A Wolsey · 1998
Earlier work this paper cites.
Quantum algorithms revisited
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca · 1998
Earlier work this paper cites.
Tight bounds on quantum searching
Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp · 1998
Earlier work this paper cites.
Nested quantum search and structured problems
Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams · 2000
Earlier work this paper cites.
Constraint-based scheduling: applying constraint programming to scheduling problems , volume 39
Philippe Baptiste, Claude Le Pape, and Wim Nuijten · 2001
Earlier work this paper cites.
The alldifferent constraint: A survey
Willem-Jan Van Hoeve · 2001
Earlier work this paper cites.
Quantum constraint programming
Alessandra Di Pierro and Herbert Wiklicky · 2001
Earlier work this paper cites.
Integer and constraint programming approaches for round-robin tournament scheduling
Michael A Trick · 2002
Earlier work this paper cites.
Complexity and completeness of finding another solution and its application to puzzles
Takayuki Yato and Takahiro Seta · 2003
Earlier work this paper cites.
Improved algorithms for the global cardinality constraint
Claude-Guy Quimper, Alejandro López-Ortiz, Peter Van Beek, and Alexander Golynski · 2004
Earlier work this paper cites.
Quantum query complexity for some graph problems
Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace, and Oksana Scegulnaja · 2004
Earlier work this paper cites.
Maximum matchings via Gaussian elimination
Marcin Mucha and Piotr Sankowski · 2004
Earlier work this paper cites.
Quantum search algorithms
A. Ambainis · 2004
Earlier work this paper cites.
Filtering algorithms for the same constraint
Nicolas Beldiceanu, Irit Katriel, and Sven Thiel · 2004
Earlier work this paper cites.
Sudoku as a constraint problem
Helmut Simonis · 2005
Earlier work this paper cites.
On the power of Ambainis lower bounds
Shengyu Zhang · 2005
Cited alongside, same era.
Handbook of constraint programming
Francesca Rossi, Peter Van Beek, and Toby Walsh · 2006
Cited alongside, same era.
Backtracking search algorithms
Peter Van Beek · 2006
Cited alongside, same era.
Global constraints
Willem-Jan van Hoeve and Irit Katriel · 2006
Cited alongside, same era.
Quantum query complexity of some graph problems
Christoph Dürr, Mark Heiligman, Peter Høyer, and Mehdi Mhalla · 2006
Cited alongside, same era.
Quantum algorithms for matching and network flows
Andris Ambainis and Robert Špalek · 2006
Cited alongside, same era.
Global constraint catalogue: Past, present and future
Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, and Thierry Petit · 2007
A constraint-based local search backend for MiniZinc
Gustav Björdal, Jean-Noël Monette, Pierre Flener, and Justin Pearson · 2015
Later among the works it cites.
Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
Cedric Yen-Yu Lin and Han-Hsuan Lin · 2015
Later among the works it cites.
On the robustness of bucket brigade quantum ram
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O’Connor, Michele Mosca, and Priyaa Varshinee Srinivasan · 2015
Later among the works it cites.
Gallai-edmonds decomposition as a pruning technique
Radosław Cymer · 2015
Later among the works it cites.
Quantum speed-ups for solving semidefinite programs
Fernando GSL Brandao and Krysta M Svore · 2017
Later among the works it cites.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
Andris Ambainis and Martins Kokainis · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
MiniZinc: Towards a standard CP modelling language
Nicholas Nethercote, Peter J Stuckey, Ralph Becket, Sebastian Brand, Gregory J Duck, and Guido Tack · 2007
Cited alongside, same era.
On the quantum query complexity of all-pairs shortest paths
Fuwei Cai, Satoshi Tayu, and Shuichi Ueno · 2007
Cited alongside, same era.
Hybrid divide-and-conquer approach for tree search algorithms
Mathys Rennela, Alfons Laarman, and Vedran Dunjko · 2007
Cited alongside, same era.
Edge finding for cumulative scheduling
Luc Mercier and Pascal Van Hentenryck · 2008
Cited alongside, same era.
A panoply of quantum algorithms
Bartholomew Furrow · 2008
Cited alongside, same era.
Later among the works it cites.
IBM ILOG CP optimizer for scheduling
Philippe Laborie, Jérôme Rogerie, Paul Shaw, and Petr Vilím · 2018
Later among the works it cites.
Quantum-walk speedup of backtracking algorithms
Ashley Montanaro · 2018
Later among the works it cites.
Improved quantum backtracking algorithms using effective resistance estimates
Michael Jarret and Kianna Wan · 2018
Later among the works it cites.
Kyle E. C. Booth, Minh Do, J Christopher Beck, Eleanor Rieffel, Davide Venturelli, and Jeremy Frank · 2018
Later among the works it cites.
A fast algorithm for generalized arc consistency of the alldifferent constraint
Xizhe Zhang, Qian Li, and Weixiong Zhang · 2018
Later among the works it cites.
Gecode: A generic constraint development environment, 2019
Christian Schulte, Mikael Lagerkvist, and Guido Tack · 2019
Later among the works it cites.
Chuffed, a lazy clause generation solver, 2019
Geoffrey Chu, Peter J. Stuckey, Andreas Schutt, Thorsten Ehlers, Graeme Gange, and Kathryn Francis · 2019
Later among the works it cites.
Consistency for 0–1 programming
Danial Davarnia and John N Hooker · 2019
Later among the works it cites.
Experimental realization of 105-qubit random access quantum memory
N Jiang, Y-F Pu, W Chang, C Li, S Zhang, and L-M Duan · 2019
Later among the works it cites.
Applying quantum algorithms to constraint satisfaction problems
Earl Campbell, Ankur Khurana, and Ashley Montanaro · 2019
Later among the works it cites.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Quantum-accelerated global constraint filtering
Kyle E. C. Booth, Bryan O’Gorman, Jeffrey Marshall, Stuart Hadfield, and Eleanor Rieffel · 2020
Later among the works it cites.
Quantum speedup based on classical decision trees
Salman Beigi and Leila Taghavi · 2020
Later among the works it cites.
Quantum SDP-solvers: Better upper and lower bounds
Joran Van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Later among the works it cites.
Quantum speedup of branch-and-bound algorithms
Ashley Montanaro · 2020
Later among the works it cites.
Fault-tolerant resource estimation of quantum random-access memories
O. D. Matteo, V. Gheorghiu, and M. Mosca · 2020
Later among the works it cites.
Bipartite matching in nearly-linear time on moderately dense graphs
Jan van den Brand, Yin-Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang · 2020
Later among the works it cites.
⟨ 𝗊 | 𝗉𝗂𝖼 ⟩ \langle\mathsf{q}|\mathsf{pic}\rangle : Quantum circuit diagrams in LaTeX, 2020
Thomas G. Draper and Samuel A. Kutin · 2020
Later among the works it cites.
A query-efficient quantum algorithm for maximum matching on general graphs
Shelby Kimmel and R Teal Witter · 2021
Closest in time.
Fast quantum subroutines for the simplex method
Giacomo Nannicini · 2021
Closest in time.
A refined laser method and faster matrix multiplication
Josh Alman and Virginia Vassilevska Williams · 2021
Closest in time.