Reducibilities on tally and sparse sets
Work
Year: 1991
Type: article
Abstract: Classes of sets that are inter-reducible to tally sets by polynomial-time computable reducibilities are studied.Résumé.-On considère les classes d'ensembles qui sont inter-rêductibles vis-à-vis des en... more
Authors Shouwen Tang, Ronald V. Book
Institution University of California, Santa Barbara
Cites: 13
Cited by: 12
Related to: 10
FWCI: 1.904
Citation percentile (by year/subfield): 68.53
Topic: Rough Sets and Fuzzy Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: bronze