scientific article; zbMATH DE number 3558963
From MaRDI portal
Publication:4131000
Cited in
(8)- A topological approach to evasiveness
- Complete subgraphs are elusive
- Further results on the Aanderaa-Rosenberg conjecture
- On recognizing graph properties from adjacency matrices
- On the elusiveness of Hamiltonian property
- Decision tree complexity versus block sensitivity and degree
- Lower bounds to randomized algorithms for graph properties
- 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 Q4131000)