scientific article; zbMATH DE number 3557238
From MaRDI portal
Publication:4133137
zbMath0357.68058MaRDI QIDQ4133137
Ronald L. Rivest, Jean E. Vuillemin
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Algorithms in computer science (68W99) Permutation groups (20B99)
Related Items
Bipartite perfect matching as a real polynomial ⋮ Elusive properties of infinite graphs ⋮ Using Brouwer’s Fixed Point Theorem ⋮ Unnamed Item ⋮ Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive ⋮ Some results on the complexity of families of sets ⋮ An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties ⋮ Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs ⋮ Further results on the Aanderaa-Rosenberg conjecture ⋮ Packings of graphs and applications to computational complexity ⋮ The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables ⋮ A topological approach to evasiveness
