51213
If we allow polynomial variations in running time , Cobham-Edmonds thesis states that " the time complexities in any two reasonable and general models of computation are polynomially related " .
 person: Cobham-Edmonds
Given options, please tell me the categories of all the listed entity words.Output format is "type1: word1; type2: word2". 
Option: location, person, organization 
Text: {0} 
 Entities: Cobham-Edmonds 
Answer:
 person: Cobham-Edmonds