{"id":2737,"date":"2019-09-10T23:43:51","date_gmt":"2019-09-11T03:43:51","guid":{"rendered":"https:\/\/portfolios.cs.earlham.edu\/?p=2737"},"modified":"2025-04-24T17:02:01","modified_gmt":"2025-04-24T21:02:01","slug":"cs388-week3-updates","status":"publish","type":"post","link":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/","title":{"rendered":"CS388-Week3-Updates"},"content":{"rendered":"\n

Idea #1<\/strong>
Name of Your Project <\/strong>Computational complexity of the \u2018Park Puzzle\u2019
What research topic\/question your project is going to address? <\/strong>The Park Puzzle is a game that involves splitting a n*n grid into different colored continuous \u2018parks\u2019. A solution to a park puzzle involves marking the position of a tree in each park such that no two trees share a row or a column. The research topic involves exploring various algorithms for solving the park puzzle, and determining some bounds on the computational complexity of the puzzle. The most involved version of this project could be to prove those bounds. (The initial, intuitive hypothesis is that the park puzzle cannot be solved in polynomial time)
Update: <\/strong>I am looking into the proofs of NP-completeness of other pencil puzzle problems to gain an understanding of the techniques involved in proving such complexity bounds. <\/p>\n\n\n\n

Idea #3
Name of Your Project <\/strong>Fast Integer multiplication
What research topic\/question your project is going to address? <\/strong>There have been significant improvements in algorithms for fast multiplication of integers\u00a0within the last decade (see Fast integer Multiplication by Anandya et al), approaching O(nlogn), which use modular arithmetic and computation on p-adics\u00a0 The research project would be to explore the theory behind these algorithms and verify their results.
Update: <\/strong>I am looking into the minimal mathematical background required to make sense of how the algorithms work, without necessarily getting into all of the details.<\/p>\n\n\n\n

Idea#3<\/strong> Iterative solvers for systems of Linear Equations
Description<\/strong> Large and sparse systems of linear equations appear in the solution to some partial differential equations by finite difference methods, and in general many day-to-day problem areas such as in engineering and scientific computing. As such the theory of developing methods for solving such large systems, and proving their correctness is an area of active research. in this project I would like to test the effectiveness of various iterative methods at finding solutions to systems linear equations with various characteristics by taking an experimental approach.
Update: <\/strong>no update for this idea<\/p>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

Idea #1Name of Your Project Computational complexity of the \u2018Park Puzzle\u2019What research topic\/question your project is going to address? The Park Puzzle is a game that involves splitting a n*n grid into different colored continuous \u2018parks\u2019. A solution to a … Read More<\/a><\/p>\n","protected":false},"author":77,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[80,93,19],"tags":[],"class_list":["post-2737","post","type-post","status-publish","format-standard","hentry","category-80","category-aditya-karan-kamireddy","category-student"],"yoast_head":"\nCS388-Week3-Updates - CS\/DS Student Portfolios<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"CS388-Week3-Updates - CS\/DS Student Portfolios\" \/>\n<meta property=\"og:description\" content=\"Idea #1Name of Your Project Computational complexity of the \u2018Park Puzzle\u2019What research topic\/question your project is going to address? The Park Puzzle is a game that involves splitting a n*n grid into different colored continuous \u2018parks\u2019. A solution to a … Read More\" \/>\n<meta property=\"og:url\" content=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/\" \/>\n<meta property=\"og:site_name\" content=\"CS\/DS Student Portfolios\" \/>\n<meta property=\"article:published_time\" content=\"2019-09-11T03:43:51+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-04-24T21:02:01+00:00\" \/>\n<meta name=\"author\" content=\"Aditya Karan Kamireddy\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Aditya Karan Kamireddy\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/\"},\"author\":{\"name\":\"Aditya Karan Kamireddy\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/d7e8b6f9b346a36824de1e4db489d95a\"},\"headline\":\"CS388-Week3-Updates\",\"datePublished\":\"2019-09-11T03:43:51+00:00\",\"dateModified\":\"2025-04-24T21:02:01+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/\"},\"wordCount\":342,\"commentCount\":0,\"articleSection\":[\"2020\",\"Aditya Karan Kamireddy\",\"Student\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/\",\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/\",\"name\":\"CS388-Week3-Updates - CS\\\/DS Student Portfolios\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#website\"},\"datePublished\":\"2019-09-11T03:43:51+00:00\",\"dateModified\":\"2025-04-24T21:02:01+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/d7e8b6f9b346a36824de1e4db489d95a\"},\"breadcrumb\":{\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/2019\\\/09\\\/10\\\/cs388-week3-updates\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"CS388-Week3-Updates\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#website\",\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/\",\"name\":\"CS\\\/DS Student Portfolios\",\"description\":\"AI and ML, Image Classification, Arduino\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/#\\\/schema\\\/person\\\/d7e8b6f9b346a36824de1e4db489d95a\",\"name\":\"Aditya Karan Kamireddy\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g\",\"caption\":\"Aditya Karan Kamireddy\"},\"url\":\"https:\\\/\\\/portfolios.cs.earlham.edu\\\/index.php\\\/author\\\/akamir16\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"CS388-Week3-Updates - CS\/DS Student Portfolios","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/","og_locale":"en_US","og_type":"article","og_title":"CS388-Week3-Updates - CS\/DS Student Portfolios","og_description":"Idea #1Name of Your Project Computational complexity of the \u2018Park Puzzle\u2019What research topic\/question your project is going to address? The Park Puzzle is a game that involves splitting a n*n grid into different colored continuous \u2018parks\u2019. A solution to a … Read More","og_url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/","og_site_name":"CS\/DS Student Portfolios","article_published_time":"2019-09-11T03:43:51+00:00","article_modified_time":"2025-04-24T21:02:01+00:00","author":"Aditya Karan Kamireddy","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Aditya Karan Kamireddy","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/#article","isPartOf":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/"},"author":{"name":"Aditya Karan Kamireddy","@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/d7e8b6f9b346a36824de1e4db489d95a"},"headline":"CS388-Week3-Updates","datePublished":"2019-09-11T03:43:51+00:00","dateModified":"2025-04-24T21:02:01+00:00","mainEntityOfPage":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/"},"wordCount":342,"commentCount":0,"articleSection":["2020","Aditya Karan Kamireddy","Student"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/","url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/","name":"CS388-Week3-Updates - CS\/DS Student Portfolios","isPartOf":{"@id":"https:\/\/portfolios.cs.earlham.edu\/#website"},"datePublished":"2019-09-11T03:43:51+00:00","dateModified":"2025-04-24T21:02:01+00:00","author":{"@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/d7e8b6f9b346a36824de1e4db489d95a"},"breadcrumb":{"@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/portfolios.cs.earlham.edu\/index.php\/2019\/09\/10\/cs388-week3-updates\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/portfolios.cs.earlham.edu\/"},{"@type":"ListItem","position":2,"name":"CS388-Week3-Updates"}]},{"@type":"WebSite","@id":"https:\/\/portfolios.cs.earlham.edu\/#website","url":"https:\/\/portfolios.cs.earlham.edu\/","name":"CS\/DS Student Portfolios","description":"AI and ML, Image Classification, Arduino","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/portfolios.cs.earlham.edu\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/portfolios.cs.earlham.edu\/#\/schema\/person\/d7e8b6f9b346a36824de1e4db489d95a","name":"Aditya Karan Kamireddy","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/7f53f31194a953e711cce5369b012a6dd211fadb036979b3ecf6154e61c5b815?s=96&d=mm&r=g","caption":"Aditya Karan Kamireddy"},"url":"https:\/\/portfolios.cs.earlham.edu\/index.php\/author\/akamir16\/"}]}},"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"Aditya Karan Kamireddy","author_link":"https:\/\/portfolios.cs.earlham.edu\/index.php\/author\/akamir16\/"},"rttpg_comment":0,"rttpg_category":"<a href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/category\/student\/2020\/\" rel=\"category tag\">2020<\/a> <a href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/category\/student\/2020\/aditya-karan-kamireddy\/\" rel=\"category tag\">Aditya Karan Kamireddy<\/a> <a href=\"https:\/\/portfolios.cs.earlham.edu\/index.php\/category\/student\/\" rel=\"category tag\">Student<\/a>","rttpg_excerpt":"Idea #1Name of Your Project Computational complexity of the \u2018Park Puzzle\u2019What research topic\/question your project is going to address? The Park Puzzle is a game that involves splitting a n*n grid into different colored continuous \u2018parks\u2019. A solution to a … Read More","_links":{"self":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2737","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/users\/77"}],"replies":[{"embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/comments?post=2737"}],"version-history":[{"count":1,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2737\/revisions"}],"predecessor-version":[{"id":2738,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/posts\/2737\/revisions\/2738"}],"wp:attachment":[{"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/media?parent=2737"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/categories?post=2737"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/portfolios.cs.earlham.edu\/index.php\/wp-json\/wp\/v2\/tags?post=2737"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}