The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence
Rubens Viana Ramos
Abstract
In this short communication it is discussed the relation between disentangled states and algorithmic information theory aiming to construct an irreducible sentence whose length increases in a non-polynomial way when the number of qubits increases.
Create a lesson
Related papers
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal et al.
Efficient Randomized Communication Without Large Monochromatic Rectangles
Haoyu Wang, Pei Wu
On the Turing Completeness of Transformers and Agents
Yimu Qiao, Lijia Yu, Ruichen Qiu et al.
Dense Pinwheel Packing Is Strongly NP-Complete
Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky
A Separation Between Distribution-Free SQ Learning and Dimension Complexity
Shyamal Patel
Almost Optimal FPT Inapproximability for k-SetCover
Venkatesan Guruswami, Xuandi Ren