scientific article; zbMATH DE number 403952

zbMath0819.68063MaRDI QIDQ4201936

Hemaspaandra, Lane A.

Publication date: 6 September 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

membership problemNP-complete setsmembership testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

On sets polynomially enumerable by iteration, Polynomial-time compression, The intractability of computing the Hamming distance, The complexity of computing maximal word functions