Results 11 to 20 of about 3,990 (244)
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 +5 more sources
Many bounded versions of undecidable problems are NP-hard
SciPost Physics, 2023 Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations.
Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma de las Cuevas
doaj +1 more source
Denture base adaptation, retention, and mechanical properties of BioHPP versus nano-alumina-modified polyamide resins [PDF]
Journal of Dental Research, Dental Clinics, Dental Prospects, 2021 Background. Continuous development of denture base materials has led to the introduction of innovative alternatives to polymethyl methacrylate.
Radwa Mohsen Kamal Emera +1 more
doaj +1 more source
Improved lower bound for the complexity of unique shortest vector problem
Cybersecurity, 2023 Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography. Many cryptographic schemes based their security on it. For the cofidence of those applications, it is essential to clarify the complexity of uSVP with different ...
Baolong Jin, Rui Xue
doaj +1 more source
Current Research in Food Science, 2022 Protein inadequacy is the major problem for most plant-based dairy yoghurt substitutes. This study investigated three limited degree of hydrolysis (DH: 1%, 5%, and 9%) of almond protein and the combined effect of DH and hydrolysed almond protein (HP) to ...
Jia Zhao +3 more
doaj +1 more source
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.
Batog, Guillaume, Goaoc, Xavier
openaire +3 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
, 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$.
Lokshtanov, Daniel +1 more
openaire +4 more sources
Protein Design is NP-hard [PDF]
Protein Engineering, Design and Selection, 2002 Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context
Pierce, Niles A., Winfree, Erik
openaire +3 more sources
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.
King, James, Krohn, Erik
openaire +3 more sources