scientific article; zbMATH DE number 3460321

MaRDI QIDQ4046079zbMATH OpenFDO

Authors

Publication date 1974

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Graph theory (05C99) Algorithms in computer science (68W99)

Cited in

(15)

• A topological approach to evasiveness
• On lattices with Möbius function \(\pm 1,0\)
• Some results on the complexity of families of sets
• On computing majority by comparisons
• Further results on the Aanderaa-Rosenberg conjecture
• On recognizing graph properties from adjacency matrices
• On the recognition complexity of some graph properties
• Using Brouwer’s Fixed Point Theorem
• The smallest nonevasive graph property
• Simplicial complexes and the evasiveness conjecture
• Elusive properties of infinite graphs
• Searching for an edge in a graph
• An asymptotic bound for the complexity of monotone graph properties
• Decision tree complexity versus block sensitivity and degree
• Counting small induced subgraphs: scorpions are easy but not trivial

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 Q4046079)