Suchergebnisse - [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front von 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 …”
Volltext

Multifractal Desynchronization of the Cardiac Excitable Cell Network During Atrial Fibrillation. I. Multifractal Analysis of Clinical Data von 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 …”
Volltext

Oritatami: A Computational Model for Molecular Co-Transcriptional Folding von 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 …”
Volltext

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

“… , COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely …”
Volltext

From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows von 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 …”
Volltext

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

“… This paper studies three classes of cellular automata from a computational point of view …”
Volltext

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

“… Schröder trees has linear expected complexity and my algorithm that generates Motzkin trees is in O(n …”
Volltext

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

Volltext

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

Volltext

A Type System Describing Unboundedness von 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 …”
Volltext

New schemes for simplifying binary constraint satisfaction problems von 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 …”
Volltext

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

Volltext

Constrained ear decompositions in graphs and digraphs von 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 …”
Volltext

On interval number in cycle convexity von 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 …”
Volltext

Vertex order with optimal number of adjacent predecessors von 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 …”
Volltext

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

Volltext

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

Volltext

Computing metric hulls in graphs von 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 …”
Volltext

Permutation Pattern matching in (213, 231)-avoiding permutations von 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 …”
Volltext

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

Volltext