Publication:2768393
From MaRDI portal
zbMath1022.05026MaRDI QIDQ2768393
Publication date: 26 October 2003
68W05: Nonnumerical algorithms
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Functions that have read‐twice constant width branching programs are not necessarily testable, Testing permutation properties through subpermutations, Functions that have read-once branching programs of quadratic size are not necessarily testable, A large lower bound on the query complexity of a simple Boolean function, Testing hypergraph colorability, Testing of matrix-poset properties