5G mobile communication using a high carrier frequency can operate a massive array antenna. A large-scale antenna element is a major factor that increases the hardware and software complexity of an array antenna. In s...
详细信息
Halpern-Shoham logic (HS) is a highly expressive interval temporal logic but the satisfiability problem of its formulas is undecidable. The main goal in the research area is to introduce fragments of the logic which a...
详细信息
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, 'computational complexity in Non-Turing Models of Computation'. Based on investigation of a mo...
详细信息
Recently, it has been recognized that the dilation of the LMI characterizations has new potentials in dealing with such involved problems as multi-objective control, robust performance analysis or synthesis for real p...
详细信息
The Multidimensional Multiscale Parser algorithm was originally proposed as a generic lossy data compression algorithm. An high degree of adaptivity and versatility allowed it to outperform state-of-the-art transform-...
详细信息
This paper provides a complete solution to the problem of minimizing the number of edges in the directed graph, the removal of which blocks all paths that pass through a set of undesirable nodes. The minimization prob...
详细信息
The paper is concerned with analyzing and comparing two exact algorithms from the viewpoint of computational complexity. Both are for calculating fault-detection tests for digital circuits. The first one is the so-cal...
详细信息
computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms a straight line drawing ...
详细信息
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent true after the sequence of actions. I...
详细信息
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent true after the sequence of actions. In many real-life planning problems, the goal is represented in a much more complicated temporal form: e.g., in addition to having a desired fluent true at the end, we may want to keep certain fluents true at all times. In this paper, we study the complexity of planning for such temporal goals. We show that for goals expressible in Linear Temporal Logic, planning has the same complexity as for non-temporal goals: it is NP-complete;and for goals expressible in a more general Branching Temporal Logic, planning is PSPACE-complete.
The simultaneous elementary E-matching problem for an equational theory E is to decide whether there is an E-marcher for a given system of equations in which the only function symbols occurring in the terms to be matc...
详细信息
暂无评论