scientific article; zbMATH DE number 3876594

MaRDI QIDQ3341898zbMATH OpenFDO

Authors Dan A. Simovici

Publication date 1982

zbMATH Keywords

closure propertiescomplexitycontext sensitive languageTuring machine

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1302031
• On a certain complexity estimate in graph theory
• Complexity of computation of some functions of graphs
• scientific article; zbMATH DE number 706829
• On Graph Complexity
• Computational complexity of graphs
• The complexity of finite graphs
• scientific article; zbMATH DE number 7300406
• Computational complexity of the graph approximation problem
• scientific article; zbMATH DE number 219271

Cited in

(13)

• A bound for the complexity of a simple graph
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• On the computational complexity of graph closures
• Graph complexity and slice functions
• A computational complexity comparative study of graph tessellation problems
• On the typical case complexity of graph optimization
• On the complexity of computing the excessive \([B]\)-index of a graph
• Complexity aspects of the computation of the rank of a graph
• scientific article; zbMATH DE number 3874608 (Why is no real title available?)
• scientific article; zbMATH DE number 5527901 (Why is no real title available?)
• scientific article; zbMATH DE number 219271 (Why is no real title available?)
• scientific article; zbMATH DE number 3997177 (Why is no real title available?)
• On the complexity of some problems related to graph extensions

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