scientific article; zbMATH DE number 3557238

MaRDI QIDQ4133137zbMATH OpenFDO

Authors Ronald L. Rivest, Jean E. Vuillemin

Publication date 1975

Mathematics Subject Classification ID

Graph theory (05C99) Permutation groups (20B99) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(11)

• A topological approach to evasiveness
• Some results on the complexity of families of sets
• An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
• 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
• Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
• Using Brouwer’s Fixed Point Theorem
• On the decision tree complexity of string matching
• Elusive properties of infinite graphs
• Testing whether a digraph contains H-free k-induced subgraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133137)