Related papers: On the Computational Complexity of Limit Cycles in…
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.…
The convex feasibility problem consists in finding a point in the intersection of a finite family of closed convex sets. When the intersection is empty, a best compromise is to search for a point that minimizes the sum of the squared…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…
Standard approaches to difference-of-convex (DC) programs require exact solution to a convex subproblem at each iteration, which generally requires noiseless computation and infinite iterations of an inner iterative algorithm. To tackle…
We investigate the singularly perturbed monotone systems with respect to cones of rank $2$ and obtain the so called Generic Poincar\'{e}-Bendixson theorem for such perturbed systems, that is, for a bounded positively invariant set, there…
Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…
We propose a convex optimization procedure for black-box identification of nonlinear state-space models for systems that exhibit stable limit cycles (unforced periodic solutions). It extends the "robust identification error" framework in…
We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in…
Projection-based control (PBC) systems have significant engineering impact and receive considerable scientific attention. To properly describe closed-loop PBC systems, extensions of classical projected dynamical systems are needed, because…
Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We give an effective method for controlling the maximum number of limit cycles of some planar polynomial systems. It is based on a suitable choice of a Dulac function and the application of the well-known Bendixson-Dulac Criterion for…
For an orientation-preserving homeomorphism of the sphere, we prove that if a translation line does not accumulate in a fixed point, then it necessarily spirals towards a topological attractor. This is in analogy with the description of…
We settle the theoretical ground for the study of automata networks under block-parallel update schedules, which are somehow dual to the block-sequential ones, but allow for repetitions of automaton updates. This gain in expressivity brings…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We prove the existence of a solution to an equation governing the number density within a compact domain of a discrete particle system for a prescribed class of particle interactions taking into account the effects of the diffusion and…
We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…
Considering Limit Cycles as one of the limits of Lienard equation, an analyis analogous to centre manifold analysis has been done for a $3-D$ nonlinear system exhibiting Limit Cycle. A rigorous study on radius of the Limit Cycle orbit has…