Computer Science – Computational Complexity
Scientific paper
2006-11-16
Computer Science
Computational Complexity
2 pages
Scientific paper
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.
No associations
LandOfFree
The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-623032