English
Related papers

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

200 papers

In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…

Discrete Mathematics · Computer Science 2016-03-03 Anatoly D. Plotnikov

The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem…

Computational Complexity · Computer Science 2016-11-24 Carolin Albrecht , Frank Gurski , Jochen Rethmann , Eda Yilmaz

We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…

Computational Geometry · Computer Science 2023-04-27 Thijs van der Horst , Tim Ophelders , Bart van der Steenhoven

We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a…

Computational Complexity · Computer Science 2011-08-02 Yang D. Li

Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is…

Databases · Computer Science 2020-12-09 Christian Bessiere , Mohamed-Bachir Belaid , Nadjib Lazaar

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 automatizable unless P = NP. Indeed, we show it is…

Computational Complexity · Computer Science 2019-09-10 Albert Atserias , Moritz Müller

We review the recent developments on axion physics. Some new comments on the strong CP problem, the axion mass, and the simple energy loss mechanism of white dwarfs and related issues are included.

High Energy Physics - Phenomenology · Physics 2015-05-14 Jihn E. Kim

We continue our investigation of Hardy-type inequalities involving combinations of cylindrical and spherical weights. Compared to [Cora-Musina-Nazarov, Ann. Sc. Norm. Sup., 2024], where the quasi-spherical case was considered, we handle the…

Analysis of PDEs · Mathematics 2024-11-14 Roberta Musina , Alexander I. Nazarov

In this paper, we introduce a concept of weakly principally quasi-Baer *-rings in terms of central cover. We prove that a *-rings is a principally quasi-Baer *-rings if and only if it is weakly principally quasi-Baer *-rings with unity. A…

Combinatorics · Mathematics 2016-12-07 Anil Khairnar , B. N. Waphare

Let A be an idempotent algebra on a finite domain. We combine results of Chen 2008 and Zhuk 2015 to argue that if Inv(A) satisfies the polynomially generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the result of Zhuk…

Logic in Computer Science · Computer Science 2016-07-14 Barnaby Martin

In the pinwheel problem, one is given an $m$-tuple of positive integers $(a_1, \ldots, a_m)$ and asked whether the integers can be partitioned into $m$ color classes $C_1,\ldots,C_m$ such that every interval of length $a_i$ has non-empty…

Data Structures and Algorithms · Computer Science 2026-04-16 Robert Kleinberg , Ahan Mishra

We point out that the long-standing strong CP problem may be resolved by an anthropic argument. The key ideas are: (i) to allow explicit breaking(s) of the Peccei-Quinn symmetry which reduces the strong CP problem to the cosmological…

High Energy Physics - Phenomenology · Physics 2009-05-30 Fuminobu Takahashi

Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text.

Computational Complexity · Computer Science 2010-01-22 Rakesh Dube

We show that the affirmation $P\subseteq NP$ (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's $P\neq NP$. We show further that all the $NP$-complete problems is not polynomial and we give the…

Computational Complexity · Computer Science 2013-03-12 B. S. Kochkarev

The aim of this note is to emphasize the fact that in many papers on invexity published in prestigious journals there are not clear definitions, trivial or not clear statements and wrong proofs. We also point out the unprofessional way of…

Optimization and Control · Mathematics 2012-03-07 Constantin Zalinescu

We perform a fit to the 2006 B -> pi K data and show that there is a disagreement with the standard model. That is, the B -> pi K puzzle is still present. In fact, it has gotten worse than in earlier years. Assuming that one new-physics…

High Energy Physics - Phenomenology · Physics 2008-11-26 Seungwon Baek , David London

We prove some new degeneracy results for integral points and entire curves on surfaces; in particular, we provide the first example, to our knowledge, of a simply connected smooth variety whose sets of integral points are never…

Number Theory · Mathematics 2009-07-29 Pietro Corvaja , Umberto Zannier

Inconsistencies are pointed out in a recent proposal [L. Diosi, Phys. Rev. A 80, 064104 (2009); arXiv:0905.3908v1] for a quantum version of the classical linear Boltzmann equation.

Quantum Physics · Physics 2010-09-28 Klaus Hornberger , Bassano Vacchini

In this short note, we point out a mistake in G.Cybenko's proof of his version of the universal approximation theorem which has been widely cited. This mistake might not be easily fixable along the idea of his proof and it also leads to an…

Classical Analysis and ODEs · Mathematics 2025-12-08 Kun Wang

In the present work, we consider a fractional p-Kirchhoff equation in the entire space R^N featuring doubly nonlinearities, involving a generalized nonlocal Choquard subcritical term together with a local critical Sobolev term; the problem…

‹ Prev 1 3 4 5 6 7 10 Next ›