Very large cliques are easy to detect (Q932700): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2007.07.036 / rank | |||
Property / author | |||
Property / author: Alexander E. Andreev / rank | |||
Property / author | |||
Property / author: Stasys P. Jukna / rank | |||
Property / author | |||
Property / author: Alexander E. Andreev / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Stasys P. Jukna / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983846889 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The monotone circuit complexity of Boolean functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Induced subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Problem in Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the incompressibility of monotone DNFs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3688439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Explicit constructions of perfect hash families from algebraic curves over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762226 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2007.07.036 / rank | |||
Normal rank |
Latest revision as of 08:40, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Very large cliques are easy to detect |
scientific article |
Statements
Very large cliques are easy to detect (English)
0 references
11 July 2008
0 references
clique function
0 references
monotone circuits
0 references
perfect hashing
0 references
vertex cover
0 references
critical graphs
0 references
0 references