AI Chat AI Image Generator AI Video Text to Speech

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP

07/06/2021
∙
by   Ali Çivril, et al.
∙
0
∙

We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and NP.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 07/06/2021

Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over ℂ, ℝ, and ℤ

We show that the problem of determining the feasibility of quadratic sys...
0 Ali Çivril, et al. ∙
research
∙ 05/09/2023

Scheme-Theoretic Approach to Computational Complexity. III. SETH

We show that there exist infinitely many n ∈ℤ^+ such that for any consta...
0 Ali Çivril, et al. ∙
research
∙ 06/22/2021

A Negative Answer to P?=PSPACE

There is a conjecture on P?=PSPACE in computational complexity zoo. It i...
0 Tianrong Lin, et al. ∙
research
∙ 12/04/2017

Principle of Conservation of Computational Complexity

In this manuscript, we derive the principle of conservation of computati...
0 Gerald Friedland, et al. ∙
research
∙ 03/06/2023

The Linear Correlation of P and NP

P ?= NP or P vs NP is the core problem in computational complexity theor...
0 Bojin Zheng, et al. ∙
research
∙ 06/16/2020

On the Hardness of Problems Involving Negator Relationships in an Artificial Hormone System

The Artificial Hormone System (AHS) is a self-organizing middleware to a...
0 Eric Hutter, et al. ∙
research
∙ 08/07/2021

On the Computational Complexity of Determining Value

We look at an algorithmic information theory based definition of value o...
0 Tiasa Mondol, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal