<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Albert Heinle</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Complex Golay pairs up to length 28: A search via computer algebra and programmatic SAT</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Comput.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jsc.2019.10.013</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">102</style></volume><pages><style face="normal" font="default" size="100%">153–172</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>