Binary Covering Arrays and Existentially Closed Graphs
From MaRDI portal
Publication:5322995
Recommendations
Cites work
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3912417 (Why is no real title available?)
- scientific article; zbMATH DE number 3606467 (Why is no real title available?)
- scientific article; zbMATH DE number 1256780 (Why is no real title available?)
- scientific article; zbMATH DE number 554162 (Why is no real title available?)
- scientific article; zbMATH DE number 731845 (Why is no real title available?)
- scientific article; zbMATH DE number 1759800 (Why is no real title available?)
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- A Constructive Solution to a Tournament Problem
- A characterization of span program size and improved lower bounds for monotone span programs
- A note on graphs with a prescribed adjacency property
- A prolific construction of strongly regular graphs with the n-e. c. property
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Approximating probability distributions using small sample spaces
- Asymmetric graphs
- Classification algorithms for codes and designs
- Classification of Hadamard matrices of order 28
- Constraint models for the covering test problem
- Constructing strength three covering arrays with augmented annealing
- Covering arrays and intersecting codes
- Covering arrays of higher strength from permutation vectors
- Distributing hash families and covering arrays
- Graphs with the \(n\)-e.c. adjacency property constructed from affine planes
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Hadamard matrices of order 36 with automorphisms of order 17
- Iterative Exhaustive Pattern Generation for Logic Testing
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- On t-covering arrays
- On a Problem in Graph Theory
- On a Problem of Schütte and Erdös
- On an adjacency property of almost all graphs
- On an adjacency property of graphs
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- On the adjacency properties of paley graphs
- On the state of strength-three covering arrays
- Paley graphs satisfy all first-order adjacency axioms
- Problems and algorithms for covering arrays
- Properties of almost all graphs and complexes
- Recursive constructions of covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- Schttes Tournament Problem and Intersecting Families of Sets
- Simple Constructions of Almost k-wise Independent Random Variables
- Software and hardware testing using combinatorial covering suites
- Steiner triple systems and existentially closed graphs
- Superpolynomial lower bounds for monotone span programs
- Tabu search for covering arrays using permutation vectors
- The smallest graphs with certain adjacency properties
- Upper bounds for covering arrays by tabu search.
Cited in
(7)- Covering arrays from cyclotomy
- Suitable permutations, binary covering arrays, and Paley matrices
- Covering and radius-covering arrays: constructions and classification
- Binary covering arrays on tournaments
- Covering arrays, augmentation, and quilting arrays
- Randomized post-optimization of covering arrays
- On symmetric designs and binary 3-frameproof codes
This page was built for publication: Binary Covering Arrays and Existentially Closed Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322995)
