Efficient dynamic programming using quadrangle inequalities

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 1980-April, Issue , 1980, Pages 429-435

  Yao, F Frances ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTATION THEORY; COMPUTER PROGRAMMING;

AD HOC APPROACH; INEQUALITY CONDITIONS; OPERATION RESEARCH; OPTIMAL BINARY SEARCH TREES; PROBLEM SOLVING TECHNIQUE; SPECIAL PROPERTIES; SPEED UP;

DYNAMIC PROGRAMMING;

EID: 84944052185     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800141.804691     Document Type: Conference Paper

References (0)