Advanced Algorithms Design Problem Solver
Budget: $30 – $250 USD
I'm seeking an experienced algorithms designer to help solve complex problems to and including at the graduate level. You will be required to tackle various types, including:
- Sorting Algorithms
- Graph Algorithms
- Dynamic Programming
- String Algorithms
- Greedy Algorithms
- Backtracking Algorithms
- Divide and Conquer Algorithms
- Network Flow Algorithms
- Computational Geometry Algorithms
- Extending Limits of Intractability
- Approximation Algorithms
- Randomized Algorithms
- Linear Programming
In particular, we will delve into challenging topics such as NP and computational intractability, PSPACE, and coping with NP-completeness. Therefore, experience in dealing with these intricate subjects is mandatory.
You should have a comprehensive understanding of all possible algorithm types and be prepared to apply this knowledge to any scenario. Dedication to accuracy and a proven record of problem-solving are essential for this project.
There will be some easy problems that don't require you to design anything. But the vast majority of problems will be design problems, for which you must do the following:
A. Provide a correct algorithm that meets the problem description.
B. Have a full explanation in the English language for how you thought of getting the algorithm.
C. Implement the algorithm in Python.
D. Perform a runtime analysis.
E. Provide a proof of correctness.
Your first task will be to do the image problems, but I will need help in graduate algorithmic problems. I have posted below some of the graduate problems as well, so that you can assess whether you can solve these problems correctly, with all instructions described above, followed, with 100% accuracy.
Note: This is not for a letter grade. I am self-studying.
FOR THIS TASK, ONLY SOLVE THE COURSERA PROBLEMS AND THE 5 IMAGES. Since this really only has 1 design problem, I will classify this task as a simple task. If you can, we will go through the more difficult documents at a later point, and that task will be upgraded to a higher level task.
- Sorting Algorithms
- Graph Algorithms
- Dynamic Programming
- String Algorithms
- Greedy Algorithms
- Backtracking Algorithms
- Divide and Conquer Algorithms
- Network Flow Algorithms
- Computational Geometry Algorithms
- Extending Limits of Intractability
- Approximation Algorithms
- Randomized Algorithms
- Linear Programming
In particular, we will delve into challenging topics such as NP and computational intractability, PSPACE, and coping with NP-completeness. Therefore, experience in dealing with these intricate subjects is mandatory.
You should have a comprehensive understanding of all possible algorithm types and be prepared to apply this knowledge to any scenario. Dedication to accuracy and a proven record of problem-solving are essential for this project.
There will be some easy problems that don't require you to design anything. But the vast majority of problems will be design problems, for which you must do the following:
A. Provide a correct algorithm that meets the problem description.
B. Have a full explanation in the English language for how you thought of getting the algorithm.
C. Implement the algorithm in Python.
D. Perform a runtime analysis.
E. Provide a proof of correctness.
Your first task will be to do the image problems, but I will need help in graduate algorithmic problems. I have posted below some of the graduate problems as well, so that you can assess whether you can solve these problems correctly, with all instructions described above, followed, with 100% accuracy.
Note: This is not for a letter grade. I am self-studying.
FOR THIS TASK, ONLY SOLVE THE COURSERA PROBLEMS AND THE 5 IMAGES. Since this really only has 1 design problem, I will classify this task as a simple task. If you can, we will go through the more difficult documents at a later point, and that task will be upgraded to a higher level task.