Výsledky vyhľadávania - [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

“… In dimension three (or upper), this induces NP-hard complexities. In the planar case, common optimality property is proven…”
Získať 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ískať 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 fold before its production is complete…”
Získať plný text

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

“…, COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely…”
Získať 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ískať 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…”
Získať plný text

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

“… Schröder trees has linear expected complexity and my algorithm that generates Motzkin trees is in O(n…”
Získať 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ískať 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ískať 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ískať 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ískať plný text

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

Získať plný text

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

“… In this paper, we study the complexity of deciding whether a graph admits an ear decomposition with prescribed ear lengths…”
Získať 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ískať 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…”
Získať plný text

A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings Autor Imai, Katsunobu, Hatsuda, Takahiro, Poupet, Victor, Kota, Sato

Získať 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ískať 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ískať 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ískať plný text

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

Získať plný text