English
Related papers

Related papers: Some conditions implying if P=NP then P=PSPACE

200 papers

This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.

Computational Complexity · Computer Science 2022-12-13 Latif Salum

The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is…

Computer Science and Game Theory · Computer Science 2009-04-22 Joseph Y. Halpern

We claim to resolve the P=?NP problem via a formal argument for P=NP.

Computational Complexity · Computer Science 2007-05-23 Selmer Bringsjord , Joshua Taylor

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

Logic in Computer Science · Computer Science 2022-01-11 Lev Gordeev

This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.

Computational Complexity · Computer Science 2009-05-01 Mikael Franzen

A $p$-caterpillar is a caterpillar such that every non-leaf vertex is adjacent to exactly $p$ leaves. We give a tight minimum degree condition for a graph to have a spanning $p$-caterpillar.

Combinatorics · Mathematics 2017-11-30 Andrzej Czygrinow , Jangwon Yie

Let $S$ and $X$ be independent random variables, assuming values in the set of non-negative integers, and suppose further that both $\mathbb{E}(S)$ and $\mathbb{E}(X)$ are integers satisfying $\mathbb{E}(S)\ge \mathbb{E}(X)$. We establish a…

Probability · Mathematics 2021-03-31 Robbert Fokkink , Symeon Papavassiliou , Christos Pelekis

Let ${\mathscr P}$ be a topological property. We say that a space $X$ is ${\mathscr P}$-connected if there exists no pair $C$ and $D$ of disjoint cozero-sets of $X$ with non-${\mathscr P}$ closure such that the remainder $X\backslash(C\cup…

General Topology · Mathematics 2015-06-26 M. R. Koushesh

We show that, if PA has no non-standard models, then P=/=NP. We then give an elementary proof that PA has no non-standard models.

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…

Computational Complexity · Computer Science 2024-03-26 Jian-Gang Tang

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Metric Geometry · Mathematics 2021-10-05 Sergii Myroshnychenko

Let ${\mathbf P}^2$ denote the projective plane over a finite field ${\mathbb F}_q$. A pair of nonsingular conics $({\mathcal A}, {\mathcal B})$ in the plane is said to satisfy the Poncelet triangle condition if, considered as conics in…

Algebraic Geometry · Mathematics 2016-04-05 Jaydeep Chipalkatti

If $(X, \le_X)$ is a partially ordered set satisfying certain necessary conditions for $X$ to be order-isomorphic to the spectrum of a Noetherian domain of dimension two, we describe a new poset $(\text{str } X, \le_{\text{str } X})$ that…

Commutative Algebra · Mathematics 2021-02-09 Cory Colbert

A set of necessary and sufficient conditions under which an isotone mapping from a subset of a poset X to a poset Y has an extension to an isotone mapping from X to Y are found.

Combinatorics · Mathematics 2013-06-06 Oleksiy Dovgoshey

We may give rise to some questions related to the mathematical structures of $P$-class and $NP$-class. We have seen that one is a proper subclass of the other. Here we disclose more that $P$- class turns out to be the proper distributive…

Computational Complexity · Computer Science 2022-07-12 JongJin Kim , GwangJin Kim , JongPyo Lee , ShuanHong Wang , Ki-Bong Nam , GyungSig Seo , InSu Kim , YangGon Kim

In this article we prove that if $ X $ is a normed space and $ U $ is a polygonally-connected subset of $ X $ with $M:=\{S_i:\ i\in I\}\subset \mathcal{P}\left( U\right) $, a non-empty arbitrary family of discrete, non-empty subsets of $ U,…

General Topology · Mathematics 2024-04-25 Savvas Andronicou , Emmanouil Milakis

This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).

Computational Complexity · Computer Science 2021-10-15 Tianrong Lin

We define some pointwise properties of topological dynamical systems and give pointwise conditions for such a system possesses positive topological entropy. We give sufficient conditions to obtain positive topological entropy for maps which…

Dynamical Systems · Mathematics 2022-07-05 A. Arbieto , E. Rego

A topology on a nonempty set $X$ specifies a natural subset of $\mathcal{P}(X)$. By identifying $\mathcal{P}(\mathcal{P}(X))$ with the totally disconnected compact Hausdorff space $2^{\mathcal{P}(X)}$, the lattice $Top(X)$ of all topologies…

General Topology · Mathematics 2011-12-09 Jorge L. Bruno , Aisling E. McCluskey

A necessary condition is given for a sequence of identically distributed and pairwise positively quadrant dependent random variables obeying the strong laws of large numbers with respect to the normalising constants $n^{1/p}$ $(1 \leqslant…

Probability · Mathematics 2020-10-27 João Lita da Silva
‹ Prev 1 2 3 10 Next ›