Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set (Q3985806)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set |
scientific article; zbMATH DE number 27801
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set |
scientific article; zbMATH DE number 27801 |
Statements
Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set (English)
0 references
27 June 1992
0 references
P-printable sets
0 references
tally sets
0 references
sparse sets
0 references
