Computer Science – Computational Complexity
Scientific paper
2008-09-30
Computer Science
Computational Complexity
Some minor changes and one more reference. To appear in Ann. Math
Scientific paper
Treating a conjecture, P^#P != NP, on the separation of complexity classes as
an axiom, an implication is found in three manifold topology with little
obvious connection to complexity theory. This is reminiscent of Harvey
Friedman's work on finitistic interpretations of large cardinal axioms.
No associations
LandOfFree
Complexity Classes as Mathematical Axioms 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 Complexity Classes as Mathematical Axioms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity Classes as Mathematical Axioms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-504780