ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A continuous-time system with switching uncertainty consists of a system whose uncertain matrix may switch among a given set of matrices. The fixed-uncertainty reduction uses the matrices constructed in Corollary; these matrices are fixed-uncertainty stabilizable precisely when one of them is Hurwitz. NP-hardness conjecture. Deciding stabilizability of a continuous-time system with switching uncertainty is NP-hard. Moreover, the construction in Corollary is a valid reduction: the matrices in that construction are fixed-uncertainty stabilizable if and only if they are switched-uncertainty stabilizable. This is presented as the consequence that would follow from the preceding switching-stabilizability conjecture; the problem is described as unsettled in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.