Related papers: Characterizing PSPACE with shallow non-confluent P…
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…
The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle,…
In this paper a method of controlling nonholonomic systems within the port-Hamiltonian (pH) framework is presented. It is well known that nonholonomic systems can be represented as pH systems without Lagrange multipliers by considering a…
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of…
We investigate the particle trapping and scattering properties in a tight-binding network which consists of several subgraphs. The particle trapping condition is proved under which particles can be trapped in a subgraph without leaking.…
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditions (one easier to program, the other easier to prove…
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
Non-holonomic mechanical systems can be described by a degenerate almost-Poisson structure (dropping the Jacobi identity) in the constrained space. If enough symmetries transversal to the constraints are present, the system reduces to a…
We prove that the non-structural subtype entailment problem for finite and regular type expressions is in PSPACE. In this way we close a decidability and complexity gap pending since 1996.
Membrane computing is a branch of natural computingwhich abstracts fromthe structure and the functioning of living cells. The computation models obtained in the field of membrane computing are usually called P systems. P systems have been…
A perturbative way to investigate superfluid properties of various systems under nonuniform potential is presented. We derive the perturbation expansion of the superfluid fraction, which indicates how liquid exhibits nonclassical rotational…
We show that several reconfiguration problems known to be PSPACE-complete remain so even when limited to graphs of bounded bandwidth. The essential step is noticing the similarity to very limited string rewriting systems, whose ability to…
The concept of nestedness, in particular for ecological and economical networks, has been introduced as a structural characteristic of real interacting systems. We suggest that the nestedness is in fact another way to express a mesoscale…
In the popular solution-diffusion picture, the membrane permeability is defined as the product of the partition ratio and the diffusivity of penetrating solutes inside the membrane in the linear response regime, i.e., in equilibrium.…
Characterizing the long term behavior of dynamical systems given limited measurements is a common challenge throughout the physical and biological sciences. This is a challenging task due to the sparsity and noise inherent to empirical…
Topological boundary modes can occur at the spatial interface between a topological and gapped trivial phase and exhibit a wavefunction that exponentially decays in the gap. Here we argue that this intuition fails for a temporal boundary…
This paper deals with the non-convex power system state estimation (PSSE) problem, which plays a central role in the monitoring and operation of electric power networks. Given a set of noisy measurements, PSSE aims at estimating the vector…
We have revealed that the barrier-tunneling process in non-integrable systems is strongly linked to chaos in complex phase space by investigating a simple scattering map model. The semiclassical wavefunction reproduces complicated features…
In many high-dimensional problems, like sparse-PCA, planted clique, or clustering, the best known algorithms with polynomial time complexity fail to reach the statistical performance provably achievable by algorithms free of computational…