User:Balgopalsharma/sandbox

• 
• 
• 
• 
• 
• 

Algorithms Operations:_{Using The Worst Case}-Time execution... Problems in computer/function calculator science require some time to produce an output. Some can be executed in few seconds or minutes. Others require hours, days or even centuries to produce an output. In this paper, we propose a technique to classify a problem in any of the above two categories even without executing the input source code for a large test case. First, a control flow graph is generated from the Intermediate code of the input source code. Then, this CFG is reduced and a set of linear equations(Linear Algebra) is framed. The solution of these linear equations along with execution counter is used to determine worst case execution time. This WCET is compared with a threshold to classify the problem as either having a definite or indefinite execution time. The main advantage of this approach is that control flow analysis is automatic and user annotations in terms of markers and scope are not required in the input code. See Also

• https:Algorithm classification using Worst-Case Execution Time@IEEEXploreLibrary
• https://www.claymath.org/millennium/P_vs_NP/
• https://www.rubiks.com/
• https://en.wikipedia.org/wiki/Travelling_salesman_problem#As_a_graph_problem
• https://people.csail.mit.edu/sanchez/papers/2013.jigsaw.pact.pdf
• Matrix Approach to Boolean Calculus-->Daizhan Chang,Yin Zhao,Xiangru Xu.IEEE
• The Idempotent Matrices-->Hong Youl Lee & Se Won Park
• Systems Of Equations over Finite Boolean Algebras,Ivan Chajda
• The logic of Boolean matrices,CR Edwards,University of Bath
• The Complexity of Boolean matrix root Computation,Martin Kutz[NP Hard problem solution]
• Linear p(X)=X Preserves over General Boolean Semi-rings,LEROY B. BEASLEY AND SANG-GU LEE(1994)
• A Solution of Jacobian Problem in Boolean Algebra,Juei-Ling Ho
• An Introduction to Sign Pattern Matrices and some connections Between Boolean and Non-negative Sign patterns,Frank J Haul
• Investigating Boolean Matrix factorization;Vaclav Snasel,Jan Platos,Pavel kromer,Dusan Husek,Roman Neruda&alexander A. Frolov
• Solving Sudoku with Boolean Algebra;Abu Sayed Chaudhary&Suraiya Akhter[2012]
• Inverses of Boolean Matrices,D.E. Rutherford(1962)
• http://www.academia.edu/4526408/Algorithm_classification_using_Worst-Case_Execution_Time
• https://en.wikipedia.org/wiki/Talk:MU_puzzle
• https://en.wikipedia.org/wiki/Petersen_graph#Color
• https://en.wikipedia.org/wiki/Fifteen_puzzle
• http://www.claymath.org/millennium/Birch_and_Swinnerton-Dyer_Conjecture/
• http://www.claymath.org/millennium/Yang-Mills_Theory/