Unconventional complexity measures for unconventional computers by Blakey, E

“…One particular motivation behind unconventional computation is the desire efficiently to solve classically difficult problems—we recall chemical-computer attempts at solving NP-complete problems such as the Travelling Salesperson Problem—, with computational complexity theory offering the criteria for judging this efficiency. …”

R-prime numbers of degree k by Abdelhakim Chillali

“…Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. …”
Get full text

Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering by Aby Philip, Soorya Rethinasamy, Vincent Russo, Mark M. Wilde

“…Thus, our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory. They also demonstrate the value of a parameterized mid-circuit measurement in a VQSA.…”
Get full text

Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems by Gabriel A. Fonseca Guerra, Steve B. Furber

“…However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems). …”
Get full text

Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems by Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi

“…The interplay between statistical physics of disordered systems and computer science has brought new light into the realm of computational complexity theory, by introducing the notion of clustering of solutions, related to replica symmetry breaking. …”
Get full text

The Complexity of Bipartite Gaussian Boson Sampling by Daniel Grier, Daniel J. Brod, Juan Miguel Arrazola, Marcos Benicio de Andrade Alonso, Nicolás Quesada

“…There is therefore significant interest, from the perspective of computational complexity theory, in solidifying the mathematical foundation for the hardness of simulating these devices. …”
Get full text

Importance of the Spectral gap in Estimating Ground-State Energies by Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman

“…The field of quantum Hamiltonian complexity lies at the intersection of quantum many-body physics and computational complexity theory, with deep implications to both fields. …”
Get full text

Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization by Kosuke Tatsumura, Ryo Hidaka, Jun Nakayama, Tomoya Kashimata, Masaya Yamasaki

“…Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory. Ising machines are hardware devices that work in quantum-mechanical/quantum-inspired principles for quickly solving NP-hard optimization problems, which potentially enable making trading decisions based on NP-hard optimization in the time constraints for high-speed trading strategies. …”
Get full text

Classical simulation complexity of restricted models of quantum computation by Koh, Dax Enshan.

Get full text

A complexity theoretic approach to learning by Klivans, Adam R

Get full text

The space around BQP by Bouland, Adam Michael

Get full text

PCPs for Arthur-Merlin games and communication protocols by Drucker, Andrew Donald

Get full text

New error correcting codes from lifting by Guo, Alan Xinyu

Get full text

DISCRETE MATHEMATICS FOR COMPUTER SCIENTIST / by Ali Selamat, author 389865, Md. Hafiz Selamat, author 202067, E-Sentral(Online service)

“…As the book serves as an introductory level to computer science students, it is expected that once the students are already familiar with the presented contents, it will enable them to understand the advanced topics in computer science such as advanced theory of computer science and computational complexity theories. The chapters in this book have been organized for the students to learn and understand the main concepts of discrete mathematics for developing computer applications during the period of their studies. …”