scientific article; zbMATH DE number 3968574

zbMATH Open0601.03017MaRDI QIDQ3735699FDOQ3735699

Authors: Stasys Jukna 

Publication date: 1986

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computable functionscomputational complexity of functionsdata compresssion

Mathematics Subject Classification ID

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

Cited In (3)

• Honest computability and complexity
• The complexity of combinatorial problems with succinct input representation
• 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)