PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (51)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Encyclopedia by subject

68Q25 - Computer science :: Theory of computing :: Analysis of algorithms and problem complexity

  1. asymptotic bounds for factorial owned by stevecheng
  2. counting problem owned by Henry
  3. decision problem owned by Henry
  4. promise problem owned by Henry
  5. range problem owned by Henry
  6. search problem owned by Henry
  7. Stirling's approximation owned by drini
  8. weaker version of Stirling's approximation owned by rm50

Show empty categories:
[ up | top ]