84484
In fact , the best known deterministic matrix multiplication algorithm known at the current time is a variant of the Coppersmith–Winograd algorithm with an asymptotic running time of O ( " n " ) .
 person: Coppersmith–Winograd
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: Coppersmith–Winograd 
Answer:
 person: Coppersmith–Winograd