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

DOI10.1080/03081070290008002zbMATH Open1018.68035OpenAlexW1965918980MaRDI QIDQ4529461FDOQ4529461

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

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

zbMATH Keywords

controllabilitymulti-linear functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new decision method for elementary algebra
• Title not available (Why is that?)
• Real quantifier elimination is doubly exponential
• Title not available (Why is that?)

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)