Alphabet indexing for approximating features of symbols

DOI10.1016/S0304-3975(98)00088-7zbMath0912.68217MaRDI QIDQ1274598

Shinichi Shimozono

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

data compressionpolynomial-time approximationalphabet indexingknowledge acquistionnonapproximability

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computing methodologies and applications (68U99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An \(O(n\log n)\) algorithm for finding dissimilar strings
• Approximate solution of NP optimization problems
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• On the Approximation of Maximum Satisfiability
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

This page was built for publication: Alphabet indexing for approximating features of symbols