相关论文: The realizability problem as a special case of the…

Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…

This paper deals with (1) the truncated matrix Hamburger moment problem from the point of view of reproducing kernel Hilbert spaces of vector valued entire functions of the kind introduced and extensively studied by Louis de Branges and (2)…

For linear infinite systems the approximate controllability problem by control constraints is considered. Controllability conditions represented via system parameters are obtained. Partial differential control systems and control systems…

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational…

The main goal of this paper is to reconsider a phenomenon which was treated in earlier work of the authors' on several truncated matricial moment problems. Using a special kind of Schur complement we obtain a more transparent insight into…

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…

The classical Truncated Moment problem asks for necessary and sufficient conditions so that a linear functional $L$ on $\mathcal{P}_{d}$, the vector space of real $n$-variable polynomials of degree at most $d$, can be written as integration…

These are ten lectures on the moment problem delivered by the author at the Vietnam Institute of Advanced Studies in Mathematics, Hanoi, March 2019. The first 3 lectures are about the one-dimensional full and truncated moment problem. The…

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

The relativistic theory of unconstrained $p$-dimensional membranes ($p$-branes) is further developed and then applied to the embedding model of induced gravity. Space-time is considered as a 4-dimensional unconstrained membrane evolving in…

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While…

In this paper, we are concerned with the Neumann problem for a class of quasilinear stationary Kirchhoff-type potential systems, which involves general variable exponents elliptic operators with critical growth and real positive parameter.…

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

In quantum systems theory one of the fundamental problems boils down to: given an initial state, which final states can be reached by the dynamic system in question. Here we consider infinite dimensional open quantum dynamical systems…

Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for…

Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in…

We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional…

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In…

Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…