What are some interesting problems in theoretical computer science ...

This page is a collection of open problems in theoretical computer science. I have not investigated all of them thoroughly, but I find them interesting.

P = NP? · The existence of one-way functions · Is Graph Isomorphism in P? · Can multiplication of n by n matrices be done in O(n^2) operations?

What unsolved problems in theoretical computer science other than ...

But off the top of my head there is the unique games conjecture and a strongly polynomial time algorithm for linear programming. Upvote

List of unsolved problems in computer science - Wikipedia

Other algorithmic problems · The dynamic optimality conjecture: Do splay trees have a bounded competitive ratio? · Can a depth-first search tree be constructed in ...

Sources of open problems? - Theoretical Computer Science Stack ...

Here's a partial list of collections of open problems in TCS, broadly construed. Note that a collection of "major open problems" exists ...

The Most Important Unsolved Problem in Computer Science

Given a social network, is there a group of a specified size in which all of the people in it are friends with one another? · Given a varied ...

Highest scored questions - Theoretical Computer Science Stack ...

Wikipedia only lists two problems under "unsolved problems in computer science": P = NP? The existence of one-way functions What are other major problems that ...

Computer Science problems that are still problematic - Stack Overflow

The theoretical limits of serial computation are being reached, whereas parallel computing has no theoretical limit. Applying parallel computing ...

The 50-year-old problem that eludes theoretical computer science

This treasured problem—known as “P versus NP”—is considered at once the most important in theoretical computer science and mathematics and ...

P vs. NP -- The most notorious problem in theoretical computer ...

NP -- The most notorious problem in theoretical computer science remains open ... In the 1995 Halloween episode of The Simpsons, Homer Simpson ...

When is theoretical computer science useful? - theory - Stack Overflow

In class, we learned about the halting problem, Turing machines, reductions, etc. A lot of classmates are saying these are all abstract and ...

Theoretical Computer Science | Open Problem Garden

Theoretical Computer Science ; Sums of independent random variables with unbounded variance · Feige, ; P vs. NP · Cook; Levin, ; Exponential Algorithms for ...

Key Challenges for Theoretical Computer Science

Does access to random numbers give more computing power? Fundamental Questions: Randomness, Quantum, Crypto. Are hypothetical computers based on principles of ...

The Biggest Unsolved Problems in Computer Science - Medium

The Biggest Unsolved Problems in Computer Science · P vs NP · Real one-way functions · The fastest matrix multiplication algorithm · Polynomial ...

What are some of the hardest open problems in computer science ...

Certainly, P = NP? is the most difficult open question. It's been covered elsewhere many times, so let's move on.

MIT computer scientists on the most important unsolved problem in ...

MIT CSAIL grad students speak about what they think is the most important unsolved problem in computer science today.

On relations between Theoretical Computer Science and the other ...

More importantly, the fundamental problems of theoretical computer science, like the P vs. NP problem, have gained the appropriate prominence as central ...

mostafatouny/awesome-theoretical-computer-science - GitHub

Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, ...

Theoretical Computer Science - MIT Mathematics

The field is very active, with exciting breakthroughs and intriguing challenges. The P =? NP problem is one of the seven of the Clay Millennium Problems.

Great ideas in theoretical computer science | Hacker News

In my CS undergrad, I had an algorithms class where the professor did this and expected the students to be able to do homework assignments each week that were ...