The following pages link to Mathematical Systems Theory (Q3026825):
Displayed 50 items.
- On realization of nonlinear systems described by higher-order differential equations (Q3026826) (← links)
- Topology of the moduli space for reachable linear dynamical systems: The complex case (Q3026827) (← links)
- Permutation-exchange graphs that emulate the binary cube (Q3029048) (← links)
- Unitary immersions of nonlinear systems (Q3030663) (← links)
- Synthesis of nonlinear observers: A harmonic-analysis approach (Q3033615) (← links)
- Strong decoupling in singular systems (Q3033624) (← links)
- Recursive order estimation of stochastic control systems (Q3033666) (← links)
- Optimalq-Markov COVER for finite wordlength implementation (Q3033694) (← links)
- Classes of bounded nondeterminism (Q3034815) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
- The complexity of ranking simple languages (Q3034844) (← links)
- A note on relativized log space (Q3036705) (← links)
- Pushdown tree automata (Q3036724) (← links)
- On the periodic solutions of the Matrix Riccati equation (Q3041552) (← links)
- Lie and Morse theory for periodic orbits of vector fields and matrix Riccati equations, II (Q3042052) (← links)
- Matching and spanning in certain planar graphs (Q3043190) (← links)
- On non context-free grammar forms (Q3051397) (← links)
- On reducing the number of stack symbols in a PDA (Q3141998) (← links)
- On the effective generation of set elements within specified ranges (Q3141999) (← links)
- A model of sequential computation with Pipelined access to memory (Q3142000) (← links)
- Complexity analysis of propositional concurrent programs using domino tiling (Q3142002) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- On intractability of the classUP (Q3201755) (← links)
- A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158) (← links)
- Self-reducible sets of small density (Q3210176) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- On the definitions of some complexity classes of real numbers (Q3310597) (← links)
- A time-space tradeoff for language recognition (Q3316594) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)
- Hamiltonian dynamics with external forces and observations (Q3324692) (← links)
- Observability for two-dimensional systems (Q3325546) (← links)
- Duality between reachability and observability for adjoint systems (Q3325551) (← links)
- Identification and filtering (Q3325597) (← links)
- A several complex variables approach to feedback stabilization of linear neutral delay-differential systems (Q3328409) (← links)
- Relativized polynomial hierarchies extending two levels (Q3331211) (← links)
- Prolongations and Lyapunov functions in control systems (Q3332893) (← links)
- Towards separating nondeterminism from determinism (Q3334987) (← links)
- The theory of equivalence of Pfaffian systems and input systems under feedback (Q3335617) (← links)
- Stability and nonsingular stable precompensation: An algebraic approach (Q3337292) (← links)
- Some applications of topology to program semantics (Q3340119) (← links)
- Optimal embeddings of butterfly-like graphs in the hypercube (Q3355251) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- A unified framework for off-line permutation routing in parallel networks (Q3357514) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal (Q3358214) (← links)