P
View article: NP*: A Structural Complexity Class Based on Generative–Solving Information Asymmetry
NP*: A Structural Complexity Class Based on Generative–Solving Information Asymmetry Open
This work introduces NP*, a new structural complexity class defined by the information gap between generating hard instances and solving them in polynomial time.Using Kolmogorov-based generative complexity and a solver–side cost measure, t…
View article: NP*: A Structural Complexity Class Based on Generative–Solving Information Asymmetry
NP*: A Structural Complexity Class Based on Generative–Solving Information Asymmetry Open
This work introduces NP*, a new structural complexity class defined by the information gap between generating hard instances and solving them in polynomial time.Using Kolmogorov-based generative complexity and a solver–side cost measure, t…
View article: The PSPACE Frontier of Quantifier Alternation
The PSPACE Frontier of Quantifier Alternation Open
This paper explores the intricate relationship between quantifier alternation in logical formalisms and the computational complexity class PSPACE. PSPACE, representing problems solvable by a deterministic Turing machine using polynomial sp…
View article: The Universe solves NP-Hard Problems in Polynomial Time: Deriving the Computational Complexity Class of SDRIS from p-adic Branching
The Universe solves NP-Hard Problems in Polynomial Time: Deriving the Computational Complexity Class of SDRIS from p-adic Branching Open
The question "Does P = NP?" is the central unsolved problem of computer science. Standard complexity theory assumes computation occurs on a deterministic Turing Machine (DTM). This paper applies the SDRIS framework [1-34] to prove that the…
View article: The Universe solves NP-Hard Problems in Polynomial Time: Deriving the Computational Complexity Class of SDRIS from p-adic Branching
The Universe solves NP-Hard Problems in Polynomial Time: Deriving the Computational Complexity Class of SDRIS from p-adic Branching Open
The question "Does P = NP?" is the central unsolved problem of computer science. Standard complexity theory assumes computation occurs on a deterministic Turing Machine (DTM). This paper applies the SDRIS framework [1-34] to prove that the…
View article: The PSPACE Frontier of Quantifier Alternation
The PSPACE Frontier of Quantifier Alternation Open
This paper explores the intricate relationship between quantifier alternation in logical formalisms and the computational complexity class PSPACE. PSPACE, representing problems solvable by a deterministic Turing machine using polynomial sp…
View article: The PSPACE Frontier of Quantifier Alternation
The PSPACE Frontier of Quantifier Alternation Open
This paper explores the intricate relationship between quantifier alternation in logical formalisms and the computational complexity class PSPACE. PSPACE, representing problems solvable by a deterministic Turing machine using polynomial sp…
View article: Algorithmic Expressivity in Higher-Order Predicate Logic
Algorithmic Expressivity in Higher-Order Predicate Logic Open
This paper explores the algorithmic expressivity of higher-order predicate logic, focusing on its capacity to define computational complexity classes. By situating higher-order logic within the framework of descriptive complexity and finit…
View article: Algorithmic Expressivity in Higher-Order Predicate Logic
Algorithmic Expressivity in Higher-Order Predicate Logic Open
This paper explores the algorithmic expressivity of higher-order predicate logic, focusing on its capacity to define computational complexity classes. By situating higher-order logic within the framework of descriptive complexity and finit…
View article: Simple Circuit Extensions for XOR in PTIME
Simple Circuit Extensions for XOR in PTIME Open
The Minimum Circuit Size Problem for Partial Functions ($MCSP^*$) is hard assuming the Exponential Time Hypothesis (ETH) (Ilango, 2020). This breakthrough hardness result leveraged a characterization of the optimal $\{\land, \lor, \neg\}$ …
View article: Simple Circuit Extensions for XOR in PTIME
Simple Circuit Extensions for XOR in PTIME Open
The Minimum Circuit Size Problem for Partial Functions ($MCSP^*$) is hard assuming the Exponential Time Hypothesis (ETH) (Ilango, 2020). This breakthrough hardness result leveraged a characterization of the optimal $\{\land, \lor, \neg\}$ …
View article: Algorithmic Expressivity in Higher-Order Predicate Logic
Algorithmic Expressivity in Higher-Order Predicate Logic Open
This paper explores the algorithmic expressivity of higher-order predicate logic, focusing on its capacity to define computational complexity classes. By situating higher-order logic within the framework of descriptive complexity and finit…
View article: A novel characterization of the complexity class based on counting and comparison
A novel characterization of the complexity class based on counting and comparison Open
The complexity class Θ2P, which is the class of languages recognizable by deterministic Turing machines in polynomial time with at most logarithmic many calls to an NP oracle, received extensive attention in the literature. Its complete pr…
View article: Resilience for Regular Path Queries: Towards a Complexity Classification
Resilience for Regular Path Queries: Towards a Complexity Classification Open
The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we study how to compute the resilience of Regular Path Querie…
View article: Algorithmic Aspects of Semistability of Quiver Representations
Algorithmic Aspects of Semistability of Quiver Representations Open
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…
View article: Note for the P versus NP Problem
Note for the P versus NP Problem Open
P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John…
View article: Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries
Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries Open
We consider the problem of finding the minimal-size factorization of the provenance of self-join-free conjunctive queries, i.e.,we want to find a formula that minimizes the number of variable repetitions. This problem is equivalent to solv…
View article: A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join Open
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repair…
View article: Chase Termination Beyond Polynomial Time
Chase Termination Beyond Polynomial Time Open
The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…
View article: Note for the P versus NP Problem
Note for the P versus NP Problem Open
P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John…
View article: Note for the P versus NP Problem
Note for the P versus NP Problem Open
P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John…
View article: Note for the P versus NP Problem
Note for the P versus NP Problem Open
$P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$? It was essentially mentioned in 1955 from a letter written b…
View article: Choiceless Computation and Symmetry: Limitations of Definability
Choiceless Computation and Symmetry: Limitations of Definability Open
The search for a logic capturing PTIME is a long standing open problem in finite model theory. One of the most promising candidate logics for this is Choiceless Polynomial Time with counting (CPT). Abstractly speaking, CPT is an isomorphis…
View article: The Complexity of Iterated Reversible Computation
The Complexity of Iterated Reversible Computation Open
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its def…
View article: Rewriting with Acyclic Queries: Mind Your Head
Rewriting with Acyclic Queries: Mind Your Head Open
The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases w…
View article: Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings
Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings Open
To answer database queries over incomplete data, the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their un…
View article: Token Games and History-Deterministic Quantitative-Automata
Token Games and History-Deterministic Quantitative-Automata Open
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in so…
View article: Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings
Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings Open
To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their uni…
View article: Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting
Reconciling SHACL and Ontologies: Semantics and Validation via Rewriting Open
OWL and SHACL are two prominent W3C standards for managing RDF graphs, the data model of the Web. They are used for different purposes and make different assumptions about the completeness of data: SHACL is used for expressing integrity co…
View article: Discovering Dichotomies for Problems in Database Theory
Discovering Dichotomies for Problems in Database Theory Open
Dichotomy theorems, which characterize the conditions under which a problem can be solved efficiently, have helped identify important tractability borders for as probabilistic query evaluation, view maintenance, query containment (among ma…