Publication:4201936
From MaRDI portal
zbMath0819.68063MaRDI QIDQ4201936
Publication date: 6 September 1993
68Q25: Analysis of algorithms and problem complexity
Related Items
The intractability of computing the Hamming distance, On sets polynomially enumerable by iteration, Polynomial-time compression, The complexity of computing maximal word functions