Can NP-complete problems be solved efficiently in the physical universe? Some researchers have claimed to be able to solve NP-complete problems in polynomial time by encoding the problem in the state of a physical system and letting it evolve naturally, according to the laws of physics. However, their proposals have not proven to be very effective in practice. Additionally, there are several reasons to believe that those methods would not work if P 6= NP. We present some physical assumptions (both from classical physics and quantum mechanics) that would allow us to provably solve NP-complete problems in polynomial time by means of Physics, even if P 6= NP and NP 6⊂ BQP. We also study if our proposals are consistent with currently known laws...
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers ...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
In this paper, we show that the satisfiability problem (SAT, for short) can be solved by a quantum T...
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals includin...
There exists an important problem whether there exists an algorithm to solve an NP-complete problem...
P versus NP is considered as one of the most important open problems in computer science. This consi...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
Computations and computational complexity are fundamental for mathematics and all computer science, ...
For some problems, we know feasible algorithms for solving them. Other computational problems (such ...
At any point in history, we can find examples of problems solved mechanically, but it was in the 20t...
A computer which has access to a closed timelike curve, and can thereby send the results of calculat...
The P versus NP problem is one of the most important and unsolved problems in computer science. This...
We study the complexity of problems solvable in deterministic polynomial time with access to an NP o...
AbstractThis is a survey of work on proof complexity and proof search from a logico-algorithmic view...
The complexity class $PSPACE$ includes all computational problems that can be solved by a classical ...
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers ...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
In this paper, we show that the satisfiability problem (SAT, for short) can be solved by a quantum T...
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals includin...
There exists an important problem whether there exists an algorithm to solve an NP-complete problem...
P versus NP is considered as one of the most important open problems in computer science. This consi...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
Computations and computational complexity are fundamental for mathematics and all computer science, ...
For some problems, we know feasible algorithms for solving them. Other computational problems (such ...
At any point in history, we can find examples of problems solved mechanically, but it was in the 20t...
A computer which has access to a closed timelike curve, and can thereby send the results of calculat...
The P versus NP problem is one of the most important and unsolved problems in computer science. This...
We study the complexity of problems solvable in deterministic polynomial time with access to an NP o...
AbstractThis is a survey of work on proof complexity and proof search from a logico-algorithmic view...
The complexity class $PSPACE$ includes all computational problems that can be solved by a classical ...
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers ...
In this thesis we shall present and develop the concept of a theory machine. Theory machines describ...
In this paper, we show that the satisfiability problem (SAT, for short) can be solved by a quantum T...