pith. sign in

arxiv: 2606.06656 · v2 · pith:TLDM7JNCnew · submitted 2026-06-04 · 💻 cs.AI · cs.LO

A Study of Parallel Continuous Local Search

Cody J Christopher , Charles Gretton This is my paper

Pith reviewed 2026-06-28 00:55 UTC · model grok-4.3

classification 💻 cs.AI cs.LO
keywords continuous local searchSATpseudo-Boolean constraintsparallel algorithmshybrid solverssaddle pointsempirical evaluationconvergence behavior
0
0 comments X

The pith

Parallel continuous local search for SAT with symmetric pseudo-Boolean constraints converges quickly to stable solution quality and benefits from avoiding redundant constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates parallel continuous local search as a method for solving Boolean satisfiability problems after relaxing them to continuous optimization tasks. Experiments demonstrate that redundant constraints tend to hinder rather than help the convergence of the search process. The approach also proves useful in hybrid solver setups by rapidly finishing incomplete assignments. Furthermore, the search stabilizes at a consistent level of solution quality because the objective functions contain many saddle points that limit further gains from additional steps. These results provide guidance for deploying such methods on parallel hardware accelerators.

Core claim

The n-variable pseudo-Boolean satisfiability problem is relaxed to continuous optimization with a differentiable objective on the unit hypercube, where satisfying assignments are the global minimizers. Empirical tests of parallel local search on this relaxation show that redundant constraints inhibit convergence, that the method can quickly complete partial assignments when used as a sub-solver, and that it rapidly reaches a stable distribution of solution quality owing to saddle-dense objectives that produce diminishing returns on further iterations.

What carries the argument

The differentiable objective function obtained by relaxing the symmetric pseudo-Boolean constraints into a continuous optimization problem on the n-dimensional hypercube, solved via parallel continuous local search.

If this is right

  • Redundant constraints should be removed or avoided when applying CLS to accelerate convergence.
  • CLS can be integrated into hybrid solvers to efficiently handle the completion of partial variable assignments.
  • Due to rapid stabilization, running multiple short parallel CLS instances may be preferable to prolonged single runs.
  • Practical implementations on accelerator hardware should focus on early termination once the solution quality distribution stabilizes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Preprocessing to detect and eliminate redundant constraints could enhance CLS performance across a wider range of problems.
  • The saddle-dense property may extend to other continuous relaxations of discrete optimization tasks, suggesting a general pattern in local search behavior.
  • These findings could inform the design of stopping criteria for local search algorithms beyond SAT.

Load-bearing premise

The SAT problem instances used in the experiments, which feature symmetric pseudo-Boolean constraints, are sufficiently representative for the observed convergence behaviors to apply more generally.

What would settle it

Running the same experiments on a diverse collection of SAT instances lacking symmetric pseudo-Boolean constraints and finding that redundant constraints instead accelerate convergence or that solution quality continues to improve substantially with more steps.

read the original abstract

We study parallel Continuous Local Search (CLS) as a solution approach for Boolean satisfiability problems with symmetric pseudo-Boolean (PB) constraints. Here, the $n$-variable PB-satisfiability problem is relaxed to a continuous optimisation problem with a differentiable objective function on an $n$-dimensional hypercube. For satisfiable instances, the global minimisers of this optimisation problem correspond to satisfying assignments of the SAT problem at hand. We present several novel findings via empirical experiments: (i) redundant constraints can inhibit rather than accelerate convergence; (ii) CLS shows promise as a sub-solver in hybridised settings, quickly completing partial assignments; and (iii) local search rapidly converges to a stable distribution of solution quality (i.e., degree of satisfaction), due to saddle-dense objectives where additional solver steps yield diminishing returns. Our findings inform practical uses of CLS for SAT on modern accelerator hardware.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript studies parallel Continuous Local Search (CLS) for Boolean satisfiability problems with symmetric pseudo-Boolean constraints by relaxing the n-variable PB-satisfiability problem to a continuous optimization problem with a differentiable objective on an n-dimensional hypercube, where global minimizers correspond to satisfying assignments for satisfiable instances. It reports three novel empirical findings from experiments: (i) redundant constraints can inhibit rather than accelerate convergence, (ii) CLS shows promise as a sub-solver in hybridised settings by quickly completing partial assignments, and (iii) local search rapidly converges to a stable distribution of solution quality due to saddle-dense objectives where additional steps yield diminishing returns. The findings are positioned to inform practical uses of CLS for SAT on modern accelerator hardware.

Significance. If the reported empirical observations hold under proper verification, the work offers targeted insights into CLS behavior on SAT instances with symmetric PB constraints, including the counterintuitive effect of redundant constraints, the potential of CLS in hybrid solvers, and convergence properties in saddle-dense landscapes. These could guide practical deployment of continuous local search methods on accelerator hardware, particularly for hybrid approaches. The scoped empirical nature limits broader theoretical impact but provides concrete observations for this problem class.

major comments (1)
  1. [Abstract] Abstract: The abstract states three novel empirical findings but supplies no details on instance generation, statistical tests, baseline comparisons, or error bars. This is load-bearing for the central claims, which rest entirely on the reported experimental observations rather than derivations.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review and recommendation. We address the single major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The abstract states three novel empirical findings but supplies no details on instance generation, statistical tests, baseline comparisons, or error bars. This is load-bearing for the central claims, which rest entirely on the reported experimental observations rather than derivations.

    Authors: We agree that the abstract would benefit from additional context on the experimental setup to better support the reported findings. While the full details of instance generation (random symmetric pseudo-Boolean constraints), statistical testing, baseline comparisons, and error bars from repeated runs are provided in the experimental sections of the manuscript, we will revise the abstract to concisely incorporate high-level references to these elements without exceeding typical length constraints. This will make the central claims more self-contained in the abstract. revision: yes

Circularity Check

0 steps flagged

No significant circularity: purely empirical observations

full rationale

The paper's central claims consist of three explicit empirical findings obtained from direct experiments on SAT instances with symmetric pseudo-Boolean constraints. No derivation chain, fitted parameters renamed as predictions, or self-citation load-bearing steps are present; the abstract and described results report observed behaviors in the tested regime without reducing any quantity to its own inputs by construction. The work is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is an empirical study of an existing optimization technique applied to SAT; no new free parameters, axioms, or invented entities are introduced.

pith-pipeline@v0.9.1-grok · 5674 in / 1019 out tokens · 34382 ms · 2026-06-28T00:55:58.667650+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

135 extracted references · 23 canonical work pages

  1. [1]

    2025 , eprint=

    Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization , author=. 2025 , eprint=

    2025

  2. [2]

    Figueredo, A. J. and Wolf, P. S. A. , title =. Human Nature , volume =

  3. [3]

    2026 , eprint=

    Accelerated Fourier SAT (AFSAT): Fully Realising a GPU-based Symmetric Pseudo-Boolean SAT Solver , author=. 2026 , eprint=

    2026

  4. [4]

    Analysis of Boolean Functions , publisher=

    O'Donnell, Ryan , year=. Analysis of Boolean Functions , publisher=

  5. [5]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Massively parallel continuous local search for hybrid SAT solving on GPUs , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  6. [6]

    arXiv preprint arXiv:2105.15183 , year=

    Efficient and Modular Implicit Differentiation , author=. arXiv preprint arXiv:2105.15183 , year=

    arXiv

  7. [7]

    arXiv:2402.09983 , year=

    Optimistix: modular optimisation in JAX and Equinox , author=. arXiv:2402.09983 , year=

    arXiv

  8. [8]

    PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation

    Pytorch 2: Faster machine learning through dynamic python bytecode transformation and graph compilation , author=. Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 , pages=. doi:10.1145/3620665.3640366 , url=

    work page doi:10.1145/3620665.3640366

  9. [9]

    and Haberland, Matt and Reddy, Tyler and Cournapeau, David and Burovski, Evgeni and Peterson, Pearu and Weckesser, Warren and Bright, Jonathan and

    Virtanen, Pauli and Gommers, Ralf and Oliphant, Travis E. and Haberland, Matt and Reddy, Tyler and Cournapeau, David and Burovski, Evgeni and Peterson, Pearu and Weckesser, Warren and Bright, Jonathan and. Nature Methods , year =

  10. [10]

    DeepMind and Babuschkin, Igor and Baumli, Kate and Bell, Alison and Bhupatiraju, Surya and Bruce, Jake and Buchlovsky, Peter and Budden, David and Cai, Trevor and Clark, Aidan and Danihelka, Ivo and Dedieu, Antoine and Fantacci, Claudio and Godwin, Jonathan and Jones, Chris and Hemsley, Ross and Hennigan, Tom and Hessel, Matteo and Hou, Shaobo and Kapturo...

  11. [11]

    Artificial Intelligence , volume=

    Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions , author=. Artificial Intelligence , volume=. 2021 , publisher=

    2021

  12. [12]

    International conference on principles and practice of constraint programming , pages=

    Towards an optimal CNF encoding of boolean cardinality constraints , author=. International conference on principles and practice of constraint programming , pages=. 2005 , organization=

    2005

  13. [13]

    International conference on principles and practice of constraint programming , pages=

    Efficient CNF encoding of boolean cardinality constraints , author=. International conference on principles and practice of constraint programming , pages=. 2003 , organization=

    2003

  14. [14]

    Information Processing Letters , volume=

    A linear-time transformation of linear inequalities into conjunctive normal form , author=. Information Processing Letters , volume=. 1998 , publisher=

    1998

  15. [15]

    and Stuckey, Peter J

    Bierlee, Hendrik and Dekker, Jip J. and Stuckey, Peter J. Revisiting Pseudo-Boolean Encodings from an Integer Perspective. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 2025

    2025

  16. [16]

    Impagliazzo, Russell and Paturi, Ramamohan , title =. J. Comput. Syst. Sci. , month = mar, pages =. 2001 , issue_date =. doi:10.1006/jcss.2000.1727 , abstract =

    work page doi:10.1006/jcss.2000.1727 2001

  17. [17]

    Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers , year =

    Elffers, Jan and Gir\'. Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers , year =. Theory and Applications of Satisfiability Testing – SAT 2018: 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings , pages =. doi:10.1007/978-3-319-9...

    work page doi:10.1007/978-3-319-94144-8_5 2018

  18. [18]

    2024 , url =

    Suresh Bolusani and Mathieu Besan. 2024 , url =

    2024

  19. [19]

    Journal on Satisfiability, Boolean Modeling and Computation , volume =

    Le Berre, Daniel and Parrain, Anne , title =. Journal on Satisfiability, Boolean Modeling and Computation , volume =. 2010 , pages =

    2010

  20. [20]

    2024 , number =

    Suresh Bolusani and Mathieu Besan. 2024 , number =

    2024

  21. [21]

    INFORMS J

    Shinano, Yuji and Heinz, Stefan and Vigerske, Stefan and Winkler, Michael , title =. INFORMS J. on Computing , month = feb, pages =. 2018 , issue_date =

    2018

  22. [22]

    ArXiv , year=

    401 and beyond: improved bounds and algorithms for the Ramsey algebra search , author=. ArXiv , year=

  23. [23]

    Algebra Universalis , year =

    Tomasz Kowalski , title =. Algebra Universalis , year =. doi:10.1007/s00012-015-0353-0 , issn =

    work page doi:10.1007/s00012-015-0353-0

  24. [24]

    Alm and David A

    Jeremy F. Alm and David A. Andrews , title =. Algebra Universalis , year =. doi:10.1007/s00012-019-0592-6 , issn =

    work page doi:10.1007/s00012-019-0592-6

  25. [25]

    In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving , year =

    Vinyals, Marc and Elffers, Jan and Gir\'. In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving , year =. Theory and Applications of Satisfiability Testing – SAT 2018: 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings , pa...

    work page doi:10.1007/978-3-319-94144-8_18 2018

  26. [26]

    1987 , issn =

    On the complexity of cutting-plane proofs , journal =. 1987 , issn =. doi:10.1016/0166-218X(87)90039-4 , author =

    work page doi:10.1016/0166-218x(87)90039-4 1987

  27. [27]

    Urquhart, Alasdair , title =. J. ACM , month = jan, pages =. 1987 , issue_date =. doi:10.1145/7531.8928 , abstract =

    work page doi:10.1145/7531.8928 1987

  28. [28]

    , title =

    Cook, Stephen A. , title =. Proceedings of the Third Annual ACM Symposium on Theory of Computing , pages =. 1971 , isbn =. doi:10.1145/800157.805047 , abstract =

    work page doi:10.1145/800157.805047 1971

  29. [29]

    , title =

    Cook, Stephen A. , title =. Proceedings of the Third Annual ACM Symposium on Theory of Computing , location =. 1971 , publisher =

    1971

  30. [30]

    1995 , publisher=

    A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , author=. 1995 , publisher=

    1995

  31. [31]

    , booktitle =

    Karp, R. , booktitle =

  32. [32]

    2012 , keywords =

    Youssef Hamadi and Christoph Wintersteiger , title =. 2012 , keywords =

    2012

  33. [33]

    A Tree Decomposition Based Approach to Solve Structured SAT Instances

    Habet, Djamal and Paris, Lionel and Terrioux, Cyril , biburl =. A Tree Decomposition Based Approach to Solve Structured SAT Instances. , url =. ICTAI , ee =

  34. [34]

    Electron

    Eyal Amir and Sheila Mcllraith , title =. Electron. Notes Discret. Math. , volume =. 2001 , doi =

    2001

  35. [35]

    Wintersteiger , title =

    Youssef Hamadi and Christoph M. Wintersteiger , title =. 2013 , doi =

    2013

  36. [36]

    Marijn J. H. Heule and Oliver Kullmann and Siert Wieringa and Armin Biere , title =. Haifa Verification Conference 2011 , year =

    2011

  37. [37]

    Heule and Hans van Maaren , title =

    Marijn J.H. Heule and Hans van Maaren , title =. 2009 , month =

    2009

  38. [38]

    JaCk-SAT:

    Daniel Singer and Anthony Monnet , editor =. JaCk-SAT:. Parallel Processing and Applied Mathematics, 7th International Conference,. 2007 , doi =

    2007

  39. [39]

    and Moskewicz, Matthew H

    Zhang, Lintao and Madigan, Conor F. and Moskewicz, Matthew H. and Malik, Sharad , title =. Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design , pages =. 2001 , isbn =

    2001

  40. [40]

    An Extensible SAT-solver

    E \'e n, Niklas and S \"o rensson, Niklas. An Extensible SAT-solver. Theory and Applications of Satisfiability Testing. 2004

    2004

  41. [41]

    Manquinho and In

    Ruben Martins and Vasco M. Manquinho and In. An overview of parallel. Constraints An Int. J. , volume =. 2012 , doi =

    2012

  42. [42]

    and Madigan, Conor F

    Moskewicz, Matthew W. and Madigan, Conor F. and Zhao, Ying and Zhang, Lintao and Malik, Sharad , title =. Proceedings of the 38th Annual Design Automation Conference , pages =. 2001 , isbn =. doi:10.1145/378239.379017 , abstract =

    work page doi:10.1145/378239.379017 2001

  43. [43]

    2015 , eprint=

    Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers , author=. 2015 , eprint=

    2015

  44. [44]

    The Effect of Restarts on the Efficiency of Clause Learning , booktitle =

    Jinbo Huang , editor =. The Effect of Restarts on the Efficiency of Clause Learning , booktitle =. 2007 , url =

    2007

  45. [45]

    Between Restarts and Backjumps

    Ramos, Antonio and van der Tak, Peter and Heule, Marijn , biburl =. Between Restarts and Backjumps. , url =. SAT , editor =. doi:10.1007/978-3-642-21581-0_18 , interhash =

    work page doi:10.1007/978-3-642-21581-0_18

  46. [46]

    Information Processing Letters , year =

    Michael Luby and Alistair Sinclair and David Zuckerman , title =. Information Processing Letters , year =

  47. [47]

    2011 , issn =

    On the power of clause-learning SAT solvers as resolution engines , journal =. 2011 , issn =. doi:10.1016/j.artint.2010.10.002 , author =

    work page doi:10.1016/j.artint.2010.10.002 2011

  48. [48]

    Proceedings of the 23rd National Conference on Artificial Intelligence - Volume 1 , pages =

    Hertel, Philipp and Bacchus, Fahiem and Pitassi, Toniann and Van Gelder, Allen , title =. Proceedings of the 23rd National Conference on Artificial Intelligence - Volume 1 , pages =. 2008 , isbn =

    2008

  49. [49]

    Clause Size Reduction with all-UIP Learning

    Feng, Nick and Bacchus, Fahiem. Clause Size Reduction with all-UIP Learning. Theory and Applications of Satisfiability Testing -- SAT 2020. 2020

    2020

  50. [50]

    Haixia Jia and Cristopher Moore and Doug Strain , title =. J. Artif. Intell. Res. , volume =. 2007 , doi =

    2007

  51. [51]

    Concurrent Clause Strengthening , booktitle =

    Siert Wieringa and Keijo Heljanko , editor =. Concurrent Clause Strengthening , booktitle =. 2013 , doi =

    2013

  52. [52]

    A fast parallel SAT-solver --- efficient workload balancing , journal=

    B. A fast parallel SAT-solver --- efficient workload balancing , journal=. 1996 , month=

    1996

  53. [53]

    CoRR , volume =

    Jerry Lonlac and Engelbert Mephu Nguifo , title =. CoRR , volume =. 2017 , url =

    2017

  54. [54]

    2014 IEEE 26th International Conference on Tools with Artificial Intelligence , title=

    L. 2014 IEEE 26th International Conference on Tools with Artificial Intelligence , title=. 2014 , volume=

    2014

  55. [55]

    Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence,

    Mao Luo and Chu-Min Li and Fan Xiao and Felip Manyà and Zhipeng Lü , title =. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence,. 2017 , doi =

    2017

  56. [56]

    Minimizing Learned Clauses

    S \"o rensson, Niklas and Biere, Armin. Minimizing Learned Clauses. Theory and Applications of Satisfiability Testing - SAT 2009. 2009

    2009

  57. [57]

    Williams and P

    Brian C. Williams and P. Pandurang Nayak , title =. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence,. 1997 , url =

    1997

  58. [58]

    Knoblock , title =

    Craig A. Knoblock , title =. Artif. Intell. , volume =. 1994 , doi =

    1994

  59. [59]

    Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching , volume =

    Xu, Hongteng and Luo, Dixin and Carin, Lawrence , booktitle =. Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching , volume =

  60. [60]

    Vivifying Propositional Clausal Formulae , booktitle =

    C. Vivifying Propositional Clausal Formulae , booktitle =. 2008 , doi =

    2008

  61. [61]

    Proceedings of the Tenth National Conference on Artificial Intelligence , pages =

    Selman, Bart and Levesque, Hector and Mitchell, David , title =. Proceedings of the Tenth National Conference on Artificial Intelligence , pages =. 1992 , isbn =

    1992

  62. [62]

    SIGART Bull

    Gu, Jun , title =. SIGART Bull. , month = jan, pages =. 1992 , issue_date =. doi:10.1145/130836.130837 , abstract =

    work page doi:10.1145/130836.130837 1992

  63. [63]

    and Walsh, Toby , biburl =

    Gent, Ian P. and Walsh, Toby , biburl =. An Empirical Analysis of Search in GSAT. , url =. J. Artif. Intell. Res. (JAIR) , keywords =. doi:10.1613/jair.7 , interhash =

    work page doi:10.1613/jair.7

  64. [64]

    Kautz and Bram Cohen , editor =

    Bart Selman and Henry A. Kautz and Bram Cohen , editor =. Noise Strategies for Improving Local Search , booktitle =. 1994 , url =

    1994

  65. [65]

    Washington, DC

    I. P. Gent and T. Walsh , TITLE =. Proc. of AAAI-93 , ADDRESS = "Washington, DC", PAGES =

  66. [66]

    Tabu Search for

    Bertrand Mazure and Lakhdar Sais and. Tabu Search for. Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference,. 1997 , url =

    1997

  67. [67]

    McAllester and Bart Selman and Henry A

    David A. McAllester and Bart Selman and Henry A. Kautz , editor =. Evidence for Invariants in Local Search , booktitle =. 1997 , url =

    1997

  68. [68]

    , editor =

    John Thornton and Duc Nghia Pham and Stuart Bain and Valnir Ferreira Jr. , editor =. Additive versus Multiplicative Clause Weighting for. Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, July 25-29, 2004, San Jose, California,. 2004 , url =

    2004

  69. [69]

    Duc Nghia Pham and John Thornton and Charles Gretton and Abdul Sattar , title =. J. Satisf. Boolean Model. Comput. , volume =. 2008 , doi =

    2008

  70. [70]

    Hoos , editor =

    Holger H. Hoos , editor =. An Adaptive Noise Mechanism for WalkSAT , booktitle =. 2002 , url =

    2002

  71. [71]

    ICCAD 2001

    IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281) , title=. 2001 , volume=

    2001

  72. [72]

    , title =

    Cheeseman, Peter and Kanefsky, Bob and Taylor, William M. , title =. Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI) , year =

  73. [73]

    Mézard and G

    M. Mézard and G. Parisi and R. Zecchina , title =. Science , volume =. 2002 , doi =. https://www.science.org/doi/pdf/10.1126/science.1073287 , abstract =

    work page doi:10.1126/science.1073287 2002

  74. [74]

    Proceedings of the Twenty-Seventh

    Katsirelos, George and Sabharwal, Ashish and Samulowitz, Horst and Simon, Laurent , title =. Proceedings of the Twenty-Seventh. 2013 , url =

    2013

  75. [75]

    Proceedings of the Thirty-Second

    Francesco Leofante , title =. Proceedings of the Thirty-Second. 2018 , crossref =

    2018

  76. [76]

    2011 , issn =

    Results of the enumeration of Costas arrays of order 29 , journal =. 2011 , issn =. doi:10.3934/amc.2011.5.547 , author =

    work page doi:10.3934/amc.2011.5.547 2011

  77. [77]

    and Erickson, Keith G

    Russo, Jon C. and Erickson, Keith G. and Beard, James K. , booktitle=. Costas array search technique that maximizes backtrack and symmetry exploitation , year=

  78. [78]

    and Cenkl, M

    Brown, C.P. and Cenkl, M. and Games, R.A. and Rushanan, J.J. and Moreno, O. , booktitle=. New Enumeration Results for Costas Arrays , year=

  79. [79]

    and Rickard, S

    Drakakis, K. and Rickard, S. and Beard, J. K. and Caballero, R. and Iorio, F. and O'Brien, G. and Walsh, J. , title =. IEEE Trans. Inf. Theor. , month = oct, pages =. 2008 , issue_date =. doi:10.1109/TIT.2008.928979 , abstract =

    work page doi:10.1109/tit.2008.928979 2008

  80. [80]

    Dagster: Parallel Structured Search with Case Studies

    Burgess, Mark Alexander and Gretton, Charles and Milthorpe, Josh and Croak, Luke and Willingham, Thomas and Tiu, Alwen. Dagster: Parallel Structured Search with Case Studies. PRICAI 2022: Trends in Artificial Intelligence. 2022

    2022

Showing first 80 references.