Archive of stories published by Smith-HCV

Homepage

Open in app

Smith-HCV

All

2019

2020

2024

Abby Moss in Smith-HCV

Apr 29, 2020

Solving Hard Instances of Nonograms

Which algorithm can solve nonogram puzzles most efficiently?

1 response

Ananda Montoly in Smith-HCV

Jan 14, 2020

Graph Databases, Neo4j, and Py2neo for the Absolute Beginner

1 response

Sivan Nachum in Smith-HCV

Apr 16, 2020

Pollard’s Rho Algorithm for Prime Factorization

Zihan Miao in Smith-HCV

Apr 29, 2020

Convex Hull Algorithms in 2D

Helena(Yuhan) Shangguan, Zihan Miao, Ivy(Chenhui) Jia

Ananda Montoly in Smith-HCV

Apr 27, 2020

Randomness, Information Theory, and Kolmogorov Complexity

Sasha Yeutseyeva in Smith-HCV

Apr 28, 2020

NP-completeness of Tetris

Introduction

Brugeriomejia in Smith-HCV

Apr 30, 2020

The Job Shop Scheduling Problem

Introduction

Emily Kim in Smith-HCV

Feb 4, 2020

Big Hero 6 & Today’s World with AI

I ended up watching Big Hero 6, the Disney movie from 2014 in which…

Minesweeper is NP-complete

By Richard Kaye

Background Information of this study:

Complexity Theory: The time it takes an algorithm to solve a problem is based on n (number of inputs)

You Jeen Ha in Smith-HCV

Apr 28, 2020

Computational Complexity of Ray Tracing

As someone who games for a hobby, I find myself in awe every…

These were the top 10 stories published by Smith-HCV; you can also dive into yearly archives: 2019, 2020, and 2024.

About

Smith-HCV

Human Computation and (data) Visualization at Smith College — a place to showcase research projects, demos, course work, and other musings about people and technology.

More information