Stack Exchange
sign up | log in |

Computer Science beta
  • Questions
  • Tags
  • Tour
  • Users
  • Ask Question

Badge

 Editor First edit.

natema earned this badge

nov 18 at 11:42
Is there any nontrivial problem in the theory of serial algorithms with a nontrivial polynomial lower bound of $\Omega(n^2)$?

Others with this badge

about faq badges blog chat data legal privacy policy jobs advertising info mobile contact us feedback
Technology Life / Arts Culture / Recreation Science Other
  1. Stack Overflow
  2. Server Fault
  3. Super User
  4. Web Applications
  5. Ask Ubuntu
  6. Webmasters
  7. Game Development
  8. TeX - LaTeX
  1. Programmers
  2. Unix & Linux
  3. Ask Different (Apple)
  4. WordPress Answers
  5. Geographic Information Systems
  6. Electrical Engineering
  7. Android Enthusiasts
  8. IT Security
  1. Database Administrators
  2. Drupal Answers
  3. SharePoint
  4. User Experience
  5. Mathematica
  6. more (14)
  1. Photography
  2. Science Fiction & Fantasy
  3. Seasoned Advice (cooking)
  4. Home Improvement
  5. more (13)
  1. English Language & Usage
  2. Skeptics
  3. Mi Yodeya (Judaism)
  4. Travel
  5. Arqade (gaming)
  6. Bicycles
  7. Role-playing Games
  8. more (22)
  1. Mathematics
  2. Cross Validated (stats)
  3. Theoretical Computer Science
  4. Physics
  5. more (7)
  1. Stack Apps
  2. Meta Stack Overflow
  3. Area 51
  4. Stack Overflow Careers
site design / logo © 2013 stack exchange inc; user contributions licensed under cc-wiki with attribution required
rev 2013.5.24.702