Information-based complexity

Details Information-based complexity Information-based complexity

Jul 1987

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1987natur.328...29p&link_type=abstract

Nature, Volume 328, Issue 6125, pp. 29-33 (1987).

Computer Science

4

Scientific paper

Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available information is partial or approximate and to apply these results to specific problems. This allows one to determine what is meant by an optimal algorithm in many practical situations, and offers a variety of interesting and sometimes surprising theoretical results.

Affiliated with

Also associated with

No associations

Rating

Information-based complexity 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 Information-based complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-based complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-791660