The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence

Simple item page
dc.creatorRamos, Rubens Viana
dc.date2006-11-16
dc.date2006-12-01
dc.date.accessioned2026-07-07T08:16:49Z
dc.date.available2026-07-07T08:16:49Z
dc.descriptionIn 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.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/cs/0611081
dc.identifierhttp://arxiv.org/abs/cs/0611081
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133914
dc.subjectComputational Complexity
dc.subjectInformation Theory
dc.titleThe Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence
dc.typetext

Files

Collections

arXiv