English
Related papers

Related papers: Alternating Hierarchies for Time-Space Tradeoffs

200 papers

The polylogarithmic time hierarchy structures sub-linear time complexity. In recent work it was shown that all classes $\tilde{\Sigma}_{m}^{\mathit{plog}}$ or $\tilde{\Pi}_{m}^{\mathit{plog}}$ ($m \in \mathbb{N}$) in this hierarchy can be…

Computational Complexity · Computer Science 2019-12-02 Flavio Ferrarotti , Senén González , Klaus-Dieter Schewe , José María Turull-Torres

Our manuscript studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we…

Logic in Computer Science · Computer Science 2015-03-31 Vladimir Rybakov

We study the non-relativistic (NR) limit of relativistic spacetimes in relation with the topology of the Universe. We first show that the NR limit of the Einstein equation is only possible in Euclidean topologies, i.e. for which the…

General Relativity and Quantum Cosmology · Physics 2024-01-09 Quentin Vigneron

This paper is the second part of a two-part paper on \emph{Electromagnetic (EM) Nonreciprocity (NR)}. Part~I has defined NR, pointed out that linear NR is a stronger form of NR than nonlinear (NL) NR, explained EM Time-Reversal (TR)…

Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\mathcal{O}(\log^2 n)$ space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every…

Computational Complexity · Computer Science 2016-06-16 Vivek Anand T Kallampally , Raghunath Tewari

A spacetime group is a connected 4-dimensional Lie group G endowed with a left invariant Lorentz metric h and such that the connected component of the isometry group of h is G itself. The Newman-Penrose formalism is used to give an…

General Relativity and Quantum Cosmology · Physics 2020-08-26 Ian Anderson , Charles Torre

We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time…

Logic in Computer Science · Computer Science 2007-05-23 Ben Moszkowski

The space-time (s-t) algebra provides a mathematical model for communication and computation using values encoded as events in discretized linear (Newtonian) time. Consequently, the input-output behavior of s-t algebra and implemented…

Logic in Computer Science · Computer Science 2020-04-28 James E. Smith

Most existing Time series classification (TSC) models lack interpretability and are difficult to inspect. Interpretable machine learning models can aid in discovering patterns in data as well as give easy-to-understand insights to domain…

Machine Learning · Computer Science 2022-09-20 Ruixuan Yan , Tengfei Ma , Achille Fokoue , Maria Chang , Agung Julius

Temporal Equilibrium Logic (TEL) is a promising framework that extends the knowledge representation and reasoning capabilities of Answer Set Programming with temporal operators in the style of LTL. To our knowledge it is the first…

Logic in Computer Science · Computer Science 2015-03-03 Laura Bozzelli , David Pearce

Understanding the linear response of any system is the first step towards analyzing its linear and nonlinear dynamics, stability properties, as well as its behavior in the presence of noise. In non-Hermitian Hamiltonian systems, calculating…

This paper aims at providing a global perspective on electromagnetic nonreciprocity and clarifying confusions that arose in the recent developments of the field. It provides a general definition of nonreciprocity and classifies…

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.

Computational Complexity · Computer Science 2008-02-03 Donald E. Knuth

Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and many other areas. We consider the problem of learning LTL…

Artificial Intelligence · Computer Science 2026-01-22 Ritam Raha , Rajarshi Roy , Nathanaël Fijalkow , Daniel Neider

Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties have been proposed, and there is a need to understand their…

Logic in Computer Science · Computer Science 2020-05-13 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann

This article is devoted to completing some aspects of the classical Cauchy-Lipschitz (or Picard-Lindel\"of) theory for general nonlinear systems posed on time scales, that are closed subsets of the set of real numbers. Partial results do…

Optimization and Control · Mathematics 2012-12-21 Loïc Bourdin , Emmanuel Trélat

Given $m$ documents of total length $n$, we consider the problem of finding a longest string common to at least $d \geq 2$ of the documents. This problem is known as the \emph{longest common substring (LCS) problem} and has a classic $O(n)$…

Data Structures and Algorithms · Computer Science 2014-07-03 Tomasz Kociumaka , Tatiana Starikovskaya , Hjalte Wedel Vildhøj

Starting from topological quantum field theory, we derive space-time uncertainty relation with respect to the time interval and the spatial length proposed by Yoneya through breakdown of topological symmetry in the large N matrix model.…

High Energy Physics - Theory · Physics 2009-10-30 I. Oda

Topological phases are enriched in non-equilibrium open systems effectively described by non-Hermitian Hamiltonians. While several properties unique to non-Hermitian topological systems were uncovered, the fundamental role of symmetry in…

Quantum Physics · Physics 2019-01-18 Kohei Kawabata , Sho Higashikawa , Zongping Gong , Yuto Ashida , Masahito Ueda

The set of integrable symmetries of the nonstationary Schr\"{o}dinger equation is shown to admit a natural decomposition into subsets of mutually commuting symmetries. Hierarchies of time evolutions associated with each of these subsets…

Mathematical Physics · Physics 2007-05-23 A. K. Pogrebkov
‹ Prev 1 2 3 10 Next ›