An approximation algorithm for alphabet indexing problem (Q6487939): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A machine discovery from amino acid sequences by decision trees over regular patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230322 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Approximation of Maximum Satisfiability / rank | |||
Normal rank |
Revision as of 11:51, 3 December 2024
scientific article; zbMATH DE number 7666493
Language | Label | Description | Also known as |
---|---|---|---|
English | An approximation algorithm for alphabet indexing problem |
scientific article; zbMATH DE number 7666493 |
Statements
An approximation algorithm for alphabet indexing problem (English)
0 references
21 March 2023
0 references