The discussion focuses on identifying interesting equations for analysis using Big O notation, particularly in the context of computational complexity and number theory. The participant suggests exploring the satisfiability problem (SAT) within the complexity class P, indicating a desire for equations that appear simple but can lead to complex analyses. The conversation emphasizes the importance of specificity in discussing problems related to Landau symbols and computational science.
PREREQUISITESThis discussion is beneficial for computer scientists, mathematicians, and students interested in algorithm analysis, computational complexity, and number theory.
fresh_42 said:How about ##SAT \in \mathcal{P}\,##?
You should be far more specific in order to anybody know what you are talking about? Do you want to practice the use of Landau symbols or are you looking for interesting problems in computation science or number theory?