English
Related papers

Related papers: A Brief Note on a Recent Claim About NP-Hard Probl…

200 papers

The notion of nondeterminism has disappeared from the current definition of NP, which has led to ambiguities in understanding NP, and caused fundamental difficulties in studying the relation P versus NP. In this paper, we question the…

Computational Complexity · Computer Science 2015-01-09 Yu Li

We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and…

Computational Complexity · Computer Science 2026-04-08 Marco Sälzer , Martin Lange

A discursive, non-technical, analysis is made of some of the basic issues that arise in almost any approach to quantum gravity, and of how these issues stand in relation to recent developments in the field. Specific topics include the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Chris Isham

In this paper, we consider a fractional p-Laplacian system of equations in the entire space RN with doubly critical singular nonlinearities involving a local critical Sobolev term together with a nonlocal Choquard critical term; the problem…

Analysis of PDEs · Mathematics 2024-12-16 Ronaldo B. Assunção , Olímpio H. Miyagaki , Rafaella F. S. Siqueira

We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…

Computational Complexity · Computer Science 2025-04-08 Igor C. Oliveira

In this paper we prove that the \textsc{Min-Bisection} problem is NP-hard on \emph{unit disk graphs}, thus solving a longstanding open question.

Computational Complexity · Computer Science 2017-04-28 Josep Diaz , George B. Mertzios

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

Computational Complexity · Computer Science 2026-05-26 Arne Hole

This paper initially aimed at proposing a proof that quasi-dense logics have f.m.p, but it contains a major flaw, unfixable.

Logic in Computer Science · Computer Science 2026-03-17 Olivier Gasquet

In a brief note posted recently, the authors of arXiv:1503.07813 raised some concerns on our arxiv:1502.03821, recently published in Nature Physics. We thank them for the interest in our work and respond here to their criticisms.

Astrophysics of Galaxies · Physics 2015-04-16 Fabio Iocco , Miguel Pato , Gianfranco Bertone

It is commonplace, in the literature, to find that the Bekenstein-Hawking entropy has been endowed with having an explicit statistical interpretation. In the following essay, we discuss why such a viewpoint warrants a certain degree of…

General Relativity and Quantum Cosmology · Physics 2007-05-23 A. J. M. Medved

We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight…

Optimization and Control · Mathematics 2023-01-03 Alberto Del Pia , Jeff Linderoth , Haoran Zhu

When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell…

Quantum Physics · Physics 2024-01-09 Sevag Gharibian

Very brief summary of the most recent developments in an area of QED corrections to the parity nonconservation in atoms is presented. Main conclusion - experimental results of Wood et al do not contradict the standard model

High Energy Physics - Phenomenology · Physics 2007-05-23 M. Yu. Kuchiev , V. V. Flambaum

We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use…

Computational Complexity · Computer Science 2007-06-15 Kyle Sabo , Ryan Schmitt , Michael Silverman

In this short note we present some remarks and conjectures on two of Erd\"os's open problems in number theory.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.

Discrete Mathematics · Computer Science 2007-11-04 Sergey Gubin

We present an approximation notion for NP-hard optimization problems represented by binary functions. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time…

Computational Complexity · Computer Science 2026-05-08 Samuel Bismuth , Erel Segal-Halevi

We consider $p$-weak differentiable structures that were recently introduced by the first and last named authors, and prove that the product of $p$-weak charts is a $p$-weak chart. This implies that the product of two spaces with a $p$-weak…

Differential Geometry · Mathematics 2022-06-13 Sylvester Eriksson-Bique , Tapio Rajala , Elefterios Soultanis

The aim of this short note is to clarify some of the claims made in the comparison made in [S. Lloyd, On the uncomputability of the spectral gap, arXiv:1602.05924] between our recent result [T.S. Cubitt, D. Perez-Garcia, M.M. Wolf,…

Quantum Physics · Physics 2016-03-03 Toby S. Cubitt , David Perez-Garcia , Michael M. Wolf

In my ("not a summary") talk at the Hard Probes 2006 conference, I gave "a personal and surely biased view on only a few of the many open questions on quarkonium and electromagnetic probes". Some of the points reported in that talk are…

Nuclear Experiment · Physics 2008-11-26 Carlos Lourenco
‹ Prev 1 4 5 6 7 8 10 Next ›