Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FFTW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MathCheck / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795943567 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.01172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building Bridges between Symbolic Computation and Satisfiability Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence formulas for the construction of Williamson-type matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery of an Hadamard matrix of order 92 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard Matrices of the Williamson Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a result in the theory of code construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Complex Golay Pairs via Programmatic SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Williamson matrices of orders \(4 \cdot 29\) and \(4 \cdot 31\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Williamson matrices of order \(4n\) for \(n = 33, 35, 39\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of periodic complementary sequences and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Williamson matrices up to order 59 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Non-linear Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Attack on the Erdős Discrepancy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5295613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard matrices of Williamson type: A challenge for computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient string sorting algorithm for weighing matrices of small weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turyn type Williamson matrices up to order 99 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study of branching heuristics through the lens of global learning rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Williamson matrices and a conjecture of Ito's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary sets of sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite class of Williamson matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard's determinant theorem and the sum of four squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers / rank
 
Normal rank

Latest revision as of 02:51, 22 July 2024

scientific article
Language Label Description Also known as
English
Applying computer algebra systems with SAT solvers to the Williamson conjecture
scientific article

    Statements

    Applying computer algebra systems with SAT solvers to the Williamson conjecture (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2020
    0 references
    Williamson matrices
    0 references
    Boolean satisfiability
    0 references
    SAT solvers
    0 references
    exhaustive search
    0 references
    autocorrelation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers