Complexity Classes as Mathematical Axioms

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-504780

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.