Linearity and unprovability of set union problem strategies

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 360-366

  Loebl, Martin ^a   Nešetřil, Jaroslav ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY;

COMPLEXITY ANALYSIS; DISJOINT SETS; FINITE SET; KNOW-THAT; UNPROVABILITY;

PROBLEM SOLVING;

EID: 84899009327     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62247     Document Type: Conference Paper

References (0)