| other,19-2-P90-1014,bq | problem of enumerating all possible <term> | indexings | </term> requires <term> exponential time </term> | #17380 First, by investigating the combinatorics of free indexation, we show that the problem of enumerating all possible indexings requires exponential time. |
