Výsledky vyhledávání - "[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]"

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front Autor Dupin, Nicolas, Nielsen, Frank, Talbi, El-Ghazali

“…With many efficient solutions for a multi-objective optimization problem, this paper aims to cluster the Pareto Front in a given number of clusters K and to…”
Získat plný text

Oritatami: A Computational Model for Molecular Co-Transcriptional Folding Autor Geary, Cody, Meunier, Pierre-Étienne, Schabanel, Nicolas, Seki, Shinnosuke

“…We introduce and study the computational power of Oritatami, a theoretical model that explores greedy molecular folding, whereby a molecular strand begins to…”
Získat plný text

Leanness Computation: Small Values and Special Graph Classes Autor Coudert, David, Coulomb, Samuel, Ducoffe, Guillaume

“…Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a…”
Získat plný text

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows Autor Carvalho, Cláudio, Costa, Jonas, Lopes, Raul, Maia, Ana Karolinna, Nisse, Nicolas, Sales, Cláudia

“…An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one…”
Získat plný text

Freezing, Bounded-Change and Convergent Cellular Automata Autor Ollinger, Nicolas, Theyssier, Guillaume

“…This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only…”
Získat plný text

Almost envy-free allocations with connected bundles Autor Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker

Získat plný text

Multifractal Desynchronization of the Cardiac Excitable Cell Network During Atrial Fibrillation. I. Multifractal Analysis of Clinical Data Autor Attuel, Guillaume, Gerasimova-Chechkina, Evgeniya, Argoul, Françoise, Yahia, Hussein, Arneodo, Alain

“…Atrial fibrillation (AF) is a cardiac arrhythmia characterized by rapid and irregular atrial electrical activity with a high clinical impact on stroke…”
Získat plný text

Holonomic equations and efficient random generation of binary trees Autor Lescanne, Pierre

“…Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation…”
Získat plný text

Editorial: Advances in data-driven approaches and modeling of complex systems Autor Mohd, Mohd Hafiz, Nguyen-Huu, Tri, Park, Junpyo, Addawe, Joel, M, Haga, Hirohide

Získat plný text

A Type System Describing Unboundedness Autor Parys, Paweł

“…We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows…”
Získat plný text

Packing Arc-Disjoint Cycles in Tournaments Autor Bessy, Stéphane, Bougeret, Marin, Krithika, R., Sahu, Abhishek, Saurabh, Saket, Thiebaut, Jocelyn, Zehavi, Meirav

Získat plný text

New schemes for simplifying binary constraint satisfaction problems Autor Naanaa, Wady

“…Finding a solution to a Constraint Satisfaction Problem (CSP) is known to be an NP-hard task. This has motivatedthe multitude of works that have been devoted…”
Získat plný text

Vertex order with optimal number of adjacent predecessors Autor Jérémy Omer, Tangi Migot

“…In this paper, we study the complexity of the selection of a graph discretization order with a stepwise linear cost function. Finding such vertex ordering has…”
Získat plný text

Constrained ear decompositions in graphs and digraphs Autor Havet, Frédéric, Nisse, Nicolas

“…Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the…”
Získat plný text

On interval number in cycle convexity Autor Araujo, Julio, Ducoffe, Guillaume, Nisse, Nicolas, Suchan, Karol

“…Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph…”
Získat plný text

Computing metric hulls in graphs Autor Knauer, Kolja, Nisse, Nicolas

“…We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies…”
Získat plný text

Permutation Pattern matching in (213, 231)-avoiding permutations Autor Neou, Both, Rizzi, Romeo, Vialette, Stéphane

“…Given permutations σ of size k and π of size n with k < n, the permutation pattern matching problem is to decide whether σ occurs in π as an order-isomorphic…”
Získat plný text

Formal security proofs with minimal fuss: Implicit computational complexity at work Autor Nowak, David, Zhang, Yu

Získat plný text

Fine costs for Euclid's algorithm on polynomials and Farey maps Autor Berthé, Valérie, Nakada, Hitoshi, Natsui, Rie, Vallée, Brigitte

“…This paper studies digit-cost functions for the Euclid algorithm on polynomials with coefficients in a finite field, in terms of the number of operations…”
Získat plný text

Universal Relations and #P-Completeness Autor Fournier, Hervé, Malod, Guillaume

Získat plný text