scientific article; zbMATH DE number 3968574

MaRDI QIDQ3735699zbMATH OpenFDO

Authors Stasys Jukna

Publication date 1986

zbMATH Keywords

computable functionscomputational complexity of functionsdata compresssion

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Succinct representations of graphs
• scientific article; zbMATH DE number 3883612
• Automata, Languages and Programming
• The complexity of combinatorial problems with succinct input representation
• SOFSEM 2006: Theory and Practice of Computer Science

Cited in

(4)

• The complexity of combinatorial problems with succinct input representation
• Honest computability and complexity
• scientific article; zbMATH DE number 1008507 (Why is no real title available?)
• Automata, Languages and Programming

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 Q3735699)