scientific article
From MaRDI portal
Publication:2768393
zbMath1022.05026MaRDI QIDQ2768393
Publication date: 26 October 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Testing of matrix-poset properties ⋮ Testing permutation properties through subpermutations ⋮ Testing hypergraph colorability ⋮ Functions that have read-once branching programs of quadratic size are not necessarily testable ⋮ Functions that have read‐twice constant width branching programs are not necessarily testable ⋮ A large lower bound on the query complexity of a simple Boolean function
This page was built for publication:
