Search Results - "Computational complexity theory"

P systems with evolutional symport and membrane creation rules solving QSAT by Orellana-Martín, David, Valencia-Cabrera, Luis, Pérez-Jiménez, Mario J.

“…•A family of recognizer P systems with evolutional symport rules of length at most (1, 1) and membrane creation can efficiently solve QSAT.•There is a frontier…”
Get full text

Comment on “SAT requires exhaustive search” by Allender, Eric, Williams, Ryan

“…An article that was recently published in Frontiers of Computer Science claims to prove that P is not equal to NP. In fact, it claims to show that the SAT…”
Get full text

Quantum interactive proofs using quantum energy teleportation by Ikeda, Kazuki, Lowe, Adam

“…We present a simple quantum interactive proof (QIP) protocol using the quantum state teleportation and quantum energy teleportation (QET) protocols. QET is a…”
Get full text

Uniform solution to Subset Sum by means of virus machines by Ramírez-de-Arellano, Antonio, Orellana-Martín, David, Cabarle, Francis George C., Pérez-Jiménez, Mario J.

“…Unconventional computing plays an important role in computational complexity theory, providing unconventional computing paradigms to tighten the gap between…”
Get full text

Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems by Orellana-Martín, David, Valencia-Cabrera, Luis, Riscos-Núñez, Agustín, Pérez-Jiménez, Mario J.

“…Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on both classical and newest results…”
Get full text

Computational Resource Demands of a Predictive Bayesian Brain by Kwisthout, Johan, van Rooij, Iris

“…There is a growing body of evidence that the human brain may be organized according to principles of predictive processing. An important conjecture in…”
Get full text

A solution to the only one object problem with dissolution rules by Caselmann, Julien, Orellana-Martín, David

“…In the framework of membrane computing, (non-)uniform families of recognizer membrane systems are usually defined to solve abstract decision problems. In this…”
Get full text

Membrane creation and symport/antiport rules solving QSAT by Orellana-Martín, David, Valencia-Cabrera, Luis, Pérez-Jiménez, Mario J.

“…In Membrane Computing, different variants of devices can be found by changing both syntactical and semantic ingredients. These devices are usually called…”
Get full text

P Systems with Evolutional Communication and Division Rules by Orellana-Martín, David, Valencia-Cabrera, Luis, Pérez-Jiménez, Mario J.

“…A widely studied field in the framework of membrane computing is computational complexity theory. While some types of P systems are only capable of efficiently…”
Get full text

LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic by Carmosino, Marco, Kabanets, Valentine, Kolokolova, Antonina, Oliveira, Igor C.

“…We investigate randomized LEARN-uniformity, which captures the power of randomness and equivalence queries (EQ) in the construction of Boolean circuits for an…”
Get full text

P systems with proteins: a new frontier when membrane division disappears by Orellana-Martín, David, Valencia-Cabrera, Luis, Riscos-Núñez, Agustín, Pérez-Jiménez, Mario J.

“…P systems with active membranes are usually defined as devices hierarchically structured that evolve through rewriting rules. These rules take the inspiration…”
Get full text

Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains by Liu, Xudong, Truszczynski, Miroslaw

“…We study preference representation models based on partial lexicographic preference trees (PLP-trees). We propose to represent preference relations as forests…”
Get full text

On Algorithmic Statistics for Space-bounded Algorithms by Milovanov, Alexey

“…Algorithmic statistics looks for models of observed data that are good in the following sense: a model is simple (i.e., has small Kolmogorov complexity) and…”
Get full text

In Memoriam, Solomon Marcus

“…This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written…”
Get full text

Robust Optimization by Ben-Tal, Aharon, El Ghaoui, Laurent, Nemirovski, Arkadi

“…Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real…”
Get full text

Seeking computational efficiency boundaries: the Păun’s conjecture by Orellana-Martín, David, Riscos-Núñez, Agustín

“…In 2005, Gh. Păun raised an interesting question concerning the role of electrical charges in P systems with active membranes from a complexity point of view…”
Get full text

Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints by Romanova, A. A., Servakh, V. V.

“…We consider the cyclic job shop problem with no-wait constraints which consists in minimizing the cycle time. We assume that a single product is produced on a…”
Get full text

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms by Bullo, Francesco, Cortés, Jorge, Martínez, Sonia

“…This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book…”
Get full text

A theoretical formalism for analyzing agent-based models by North, Michael J

“…Purpose Following Holland, complex adaptive systems (CASs) are collections of interacting, autonomous, learning decision makers embedded in an interactive…”
Get full text

Local Restrictions from the Furst-Saxe-Sipser Paper by Tamaki, Suguru, Watanabe, Osamu

“…In their celebrated paper (Furst et al., Math. Syst. Theory 17 (1), 13–27 ( 12 )), Furst, Saxe, and Sipser used random restrictions to reveal the weakness of…”
Get full text