Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In recent years there have been major, diverse, sometimes surprising advances in experimental mathematics [1] for a variety of sophisticated uses such as developing/deriving exact formulas, theorem proving, resolving previously unresolved conjectures (some deep), etc., ie basically core areas of mathematical research activity.

Are there applications of this "experimental mathematics" in TCS/complexity theory?

[1] Experimental mathematics: examples, methods, and implications. by Bailey & Borwein, Notes of the American Mathematical Society, 2005

[2] Is"Experimental Complexity Theory" being used to solve open problems?, tcs.se

[3] A reading list on experimental algorithmics, tcs.se

share|cite|improve this question

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.