A feasibility approach for constructing combinatorial designs of circulant type (Q1752612): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recent results on Douglas-Rachford methods for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving graph coloring problems with the Douglas-Rachford algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-dual codes over F/sub p/ and weighing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant weighing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant weighing matrices of weight \(2^{2t}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of all possible orders of weight 16 circulant weighing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding D-optimal designs by randomised decomposition and switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Determinants with Elements ±1, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on D-Optimal Matrices / 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: D-Optimal Matrices of Orders 118, 138, 150, 154 and 174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching with iterated maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighing matrices and optical quantum computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5248559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadamard ideals and Hadamard matrices with two circulant cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner Bases, Coding, and Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in invariant theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group invariant weighing matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms for weighing matrices and quadratic residues / rank
 
Normal rank

Latest revision as of 17:23, 15 July 2024

scientific article
Language Label Description Also known as
English
A feasibility approach for constructing combinatorial designs of circulant type
scientific article

    Statements

    A feasibility approach for constructing combinatorial designs of circulant type (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    Strassler's table
    0 references
    circulant weighing matrices
    0 references
    circulant combinatorial designs
    0 references
    Douglas-Rachford algorithm
    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