Search Results - "Information and computation"

A mathematical theory of resources by Coecke, Bob, Fritz, Tobias, Spekkens, Robert W.

“…Many fields of science investigate states and processes as resources. Chemistry, thermodynamics, Shannon's theory of communication channels, and the theory of…”
Get full text

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth by Bodlaender, Hans L., Cygan, Marek, Kratsch, Stefan, Nederlof, Jesper

“…It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in time 2O(tw)|V|O(1) for graphs G=(V,E) with a given tree…”
Get full text

Exact algorithms for maximum independent set by Xiao, Mingyu, Nagamochi, Hiroshi

“…We show that the maximum independent set problem on an n-vertex graph can be solved in 1.1996nnO(1) time and polynomial space, which even is faster than…”
Get full text

Mutual visibility by luminous robots without collisions by Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Poloni, F., Santoro, N., Viglietta, G.

“…We consider the Mutual Visibility problem for anonymous dimensionless robots with obstructed visibility moving in a plane: starting from distinct locations,…”
Get full text

Efficient construction of the BWT for repetitive text using string compression by Díaz-Domínguez, Diego, Navarro, Gonzalo

“…We present a new semi-external algorithm that builds the Burrows–Wheeler transform variant of Bauer et al. (a.k.a., BCR BWT) in linear expected time. Our…”
Get full text

Survey on mining signal temporal logic specifications by Bartocci, Ezio, Mateis, Cristinel, Nesterini, Eleonora, Nickovic, Dejan

“…Formal specifications play an essential role in the life-cycle of modern systems, both at the time of their design and during their operation. Despite their…”
Get full text

A 1.488 approximation algorithm for the uncapacitated facility location problem by Li, Shi

“…We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka…”
Get full text

Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle by Robert, Léo, Miyahara, Daiki, Lafourcade, Pascal, Libralesso, Luc, Mizuki, Takaaki

“…Suguru is a paper and pencil puzzle invented by Naoki Inaba. The goal of the game is to fill a grid with numbers between 1 and 5 while respecting three simple…”
Get full text

Deterministic quantum search with adjustable parameters: Implementations and applications by Li, Guanzhong, Li, Lvzhou

“…Grover's algorithm provides a quadratic speedup over classical algorithms to search for marked elements in an unstructured database. The original algorithm is…”
Get full text

Polymorphic lambda calculus with context-free session types by Almeida, Bernardo, Mordido, Andreia, Thiemann, Peter, Vasconcelos, Vasco T.

“…Session types provide a typing discipline for structured communication on bidirectional channels. Context-free session types overcome the restriction to tail…”
Get full text

Session types revisited by Dardha, Ornela, Giachino, Elena, Sangiorgi, Davide

“…Session types are a formalism used to model structured communication-based programming. A binary session type describes communication by specifying the type…”
Get full text

Comparison of algorithms for simple stochastic games by Křetínský, Jan, Ramneantu, Emanuel, Slivinskiy, Alexander, Weininger, Maximilian

“…Simple stochastic games are turn-based 2½-player zero-sum graph games with a reachability objective. The problem is to compute the winning probabilities as…”
Get full text

Value iteration for simple stochastic games: Stopping criterion and learning algorithm by Eisentraut, Julia, Kelmendi, Edon, Křetínský, Jan, Weininger, Maximilian

“…The classical problem of reachability in simple stochastic games is typically solved by value iteration (VI), which produces a sequence of under-approximations…”
Get full text

Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs by Feng, Yuan, Li, Sanjiang

“…Abstract interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs. They have…”
Get full text

Logical equivalences, homomorphism indistinguishability, and forbidden minors by Seppelt, Tim

“…Two graphs G and H are homomorphism indistinguishable over a graph class F if for all graphs F∈F the number of homomorphisms from F to G is equal to the number…”
Get full text

Roadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures by Shaller, Ari, Zamir, Linir, Nojoumian, Mehrdad

“…Quantum computing utilizes properties of quantum physics to build a fast-computing machine that can perform quantum computations. This will eventually lead to…”
Get full text

Elastic-degenerate string comparison by Gabory, Estéban, Mwaniki, Moses Njagi, Pisanti, Nadia, Pissis, Solon P., Radoszewski, Jakub, Sweering, Michelle, Zuba, Wiktor

“…An elastic-degenerate (ED) string T is a sequence of n sets T[1],…,T[n] containing m strings in total whose cumulative length is N. We call n, m, and N the…”
Get full text

Parameterized problems complete for nondeterministic FPT time and logarithmic space by Bodlaender, Hans L., Groenland, Carla, Nederlof, Jesper, Swennenhuis, Céline

“…Let XNLP be the class of parameterized problems such that an instance of size n with parameter k can be solved nondeterministically in time f(k)nO(1) and space…”
Get full text

Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond by Kobayashi, Yasuaki, Kurita, Kazuhiro, Wasa, Kunihiro

“…Finding a maximum cardinality common independent set in two matroids (also known as Matroid Intersection) is a classical combinatorial optimization problem,…”
Get full text

The complexity of multi-mean-payoff and multi-energy games by Velner, Yaron, Chatterjee, Krishnendu, Doyen, Laurent, Henzinger, Thomas A., Rabinovich, Alexander, Raskin, Jean-François

“…In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy…”
Get full text