scientific article; zbMATH DE number 1688357

MaRDI QIDQ2762499zbMATH OpenFDO

Authors Amit Chakrabarti, Subhash Khot, Yaoyun Shi

Publication date 9 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2010/20100110

zbMATH Keywords

decision tree complexityevasivenessgraph property testingmonotone graph properties

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Evasiveness of subgraph containment and related properties
• A generalized model for understanding evasiveness
• An asymptotic bound for the complexity of monotone graph properties
• Evasiveness of graph properties and topological fixed-point theorems
• Monotone Bipartite Graph Properties are Evasive

Cited in

(2)

• Evasiveness of subgraph containment and related properties
• Monotone Bipartite Graph Properties are Evasive

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