Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems

DOI10.1080/03081070290008002MaRDI QIDQ4529461zbMATHOpenAlexFDO

Authors Raul Trejo, Vladik Kreinovich

Publication date 11 September 2003

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1472&context=cs_techrep

zbMATH Keywords

controllabilitymulti-linear functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of deciding controllability
• Mappability of non-linear systems onto systems of a special form and their controllability
• Controllability is Harder to Decide than Accessibility
• A survey of computational complexity results in systems and control
• Analysis of controllability of dynamic systems

Cites work

• scientific article; zbMATH DE number 53593 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3800064 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A new decision method for elementary algebra
• Real quantifier elimination is doubly exponential

This page was built for publication: Computing the shape of the image of a multi-linear mapping is possible but computationally intractable: Theorems

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