Search Results - "computational and structural complexity"

Splitting NP-Complete Sets by Glaßer, Christian, Pavan, A., Selman, Alan L., Zhang, Liyu

“…We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this…”
Get full text

Approximation Algorithms for 3D Orthogonal Knapsack by Diedrich, Florian, Harren, Rolf, Jansen, Klaus, Thöle, Ralf, Thomas, Henning

“…We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted, and we…”
Get full text

Extended skew partition problem by Dantas, Simone, de Figueiredo, Celina M.H., Gravier, Sylvain, Klein, Sulamita

“…A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A 1 , A 2 , B 1 , B 2 such that there are all…”
Get full text

The Boolean functions computed by random Boolean formulas or how to grow the right function by Brodsky, Alex, Pippenger, Nicholas

“…We characterize growth processes (probabilistic amplification) by their initial conditions to derive conditions under which results such as Valiant's J…”
Get full text

On the ultimate complexity of factorials by Cheng, Qi

“…It has long been observed that certain factorization algorithms provide a way to write the product of many different integers succinctly. In this paper, we…”
Get full text

Deadlock prevention by acyclic orientations by Bermond, Jean-Claude, Ianni, Miriam Di, Flammini, Michele, Pérennès, Stéphane

“…Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of parallel and distributed…”
Get full text

Why almost all satisfiable $k$-CNF formulas are easy by Coja-Oghlan, Amin, Krivelevich, Michael, Vilenchik, Dan

“…Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform…”
Get full text

Nonerasing, Counting, and Majority over the Linear Time Hierarchy by Durand, Arnaud, More, Malika

“…In this paper, we investigate several extensions of the linear time hierarchy (denoted by LTH). We first prove that it is not necessary to erase the oracle…”
Get full text

Path-Constrained Relaxed Schedulability Analysis by Andrei, S., Chakraborty, S.

“…The schedulability analysis problem for many realistic task models is known to be hard (NP or coNP). As this severely restricts the application of these task…”
Get full text