scientific article; zbMATH DE number 403952

MaRDI QIDQ4201936zbMATH OpenFDO

Authors Lane A. Hemaspaandra

Publication date 6 September 1993

zbMATH Keywords

membership problemmembership testingNP-complete sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Sets with Efficient Implicit Membership Tests
• Polynomial-time compression
• scientific article; zbMATH DE number 863498
• scientific article; zbMATH DE number 3999286
• Estimates of the complexity of algorithms of implementation of set-theoretic operations in table algebras

Cited in

(8)

• On sets polynomially enumerable by iteration
• Polynomial-time compression
• The complexity of computing maximal word functions
• Algorithms for Minkowski products and implicitly-defined complex sets
• On Sets with Efficient Implicit Membership Tests
• Equality testing for complex objects based on hashing
• The time complexity of the addition, removal and comparison of algorithms of table set-theoretic operations
• The intractability of computing the Hamming distance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201936)