A low-complexity algorithm to search for Legendre pairs

Perera, Sirani M (ORCID:0000000239753742); Kotsireas, Ilias S

doi:10.1016/j.laa.2025.01.010

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 5:00 PM ET until 8:00 PM ET on Friday, September 11 due to maintenance. We apologize for the inconvenience.

Citation Details

A low-complexity algorithm to search for Legendre pairs

Award ID(s):: 2229473

PAR ID:: 10653641

Author(s) / Creator(s):: Perera, Sirani M; Kotsireas, Ilias S

Publisher / Repository:: Elsevier

Date Published:: 2025-09-01

Journal Name:: Linear Algebra and its Applications

Volume:: 721

Issue:: C

ISSN:: 0024-3795

Page Range / eLocation ID:: 149 to 171

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Journal Article:
https://doi.org/10.1016/j.laa.2025.01.010

More Like this