Sciweavers

DAGSTUHL
2006
14 years 1 months ago
Very Large Cliques are Easy to Detect
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
Alexander E. Andreev, Stasys Jukna