Searching for "Reducibilities on tally and sparse sets." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Coding Complexity: The Computational Complexity of Succinct Descriptions
by José L. Balcázar, Ricard Gavaldà, Osamu Watanabe — 1996
… that are reducible to some tally set (resp., sparse set) via some reduction of type r. Proposition 3.3. [BK88…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB