Results 11 to 20 of about 460,881 (203)
On Percolation and NP-Hardness. [PDF]
, 2016 The edge-percolation and vertex-percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational hardness of problems whose inputs are obtained by applying percolation to worst-case instances.
Bennett, Huck +2 more
openaire +5 more sources
Stable marriage with incomplete lists and ties [PDF]
, 1999 The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ...
Miyazaki, S. +3 more
core +8 more sources
CoRR, 2022 Wordle is a single-player word-guessing game where the goal is to discover a secret word $w$ that has been chosen from a dictionary $D$. In order to discover $w$, the player can make at most $\ell$ guesses, which must also be words from $D$, all words in $D$ having the same length $k$.
Daniel Lokshtanov, Bernardo Subercaseaux
openaire +6 more sources
Theoretical Computer Science, 2018 Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity \cite{Eppstein}.
ALMANZA, Matteo, Leucci S., Panconesi A.
openaire +9 more sources
Symbolic Regression is NP-hard
Trans. Mach. Learn. Res., 2022 corrected citation Abbass 2002 -> Cramer ...
M. Virgolin (Marco), S. Pissis (Solon)
openaire +4 more sources
Automating Resolution is NP-Hard [PDF]
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019 We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatable unless P = NP. Indeed, we show that it is NP-hard to distinguish between formulas that have Resolution refutations of polynomial length and those that do not ...
Atserias, Albert, Muller, Moritz Martin
openaire +7 more sources
INFLATING BALLS IS NP-HARD [PDF]
International Journal of Computational Geometry & Applications, 2011 A collection [Formula: see text] of balls in ℝd is δ-inflatable if it is isometric to the intersection [Formula: see text] of some d-dimensional affine subspace E with a collection [Formula: see text] of (d + δ)-dimensional balls that are disjoint and have equal radius.
Guillaume Batog, Xavier Goaoc
openaire +4 more sources
Clifford Circuits can be Properly PAC Learned if and only if $\textsf{RP}=\textsf{NP}$ [PDF]
Quantum, 2023 Given a dataset of input states, measurements, and probabilities, is it possible to efficiently predict the measurement probabilities associated with a quantum circuit?
Daniel Liang
doaj +1 more source
Terrain Guarding is NP-Hard [PDF]
SIAM Journal on Computing, 2010 Summary: A set \(G\) of points on a terrain, also known as an \(x\)-monotone polygonal chain, is said to guard the terrain if every point on the terrain is seen by a point in \(G\). Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain.
James King 0001, Erik Krohn
openaire +4 more sources
NP-Hardness of the Problem of Optimal Box Positioning
Mathematics, 2019 We consider the problem of finding a position of a d-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set P ⊂ R d , i.e., the problem of optimal box positioning.
Alexei V. Galatenko +2 more
doaj +1 more source