scientific article; zbMATH DE number 4045148

MaRDI QIDQ3782780zbMATH OpenFDO

Authors

Publication date 1987

Full work available at URL https://eudml.org/doc/118034

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmical complexity of finite binary wordscomplexity measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3954821
• scientific article; zbMATH DE number 3892611
• scientific article; zbMATH DE number 3942590
• scientific article; zbMATH DE number 1747450
• On minimal-program complexity measures

Cited in

(5)

• scientific article; zbMATH DE number 3942590 (Why is no real title available?)
• scientific article; zbMATH DE number 3954821 (Why is no real title available?)
• scientific article; zbMATH DE number 2123422 (Why is no real title available?)
• scientific article; zbMATH DE number 3892611 (Why is no real title available?)
• A new estimate on complexity of binary generalized pseudostandard words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782780)