What's up in

# algorithms

## Latest Articles

### Cryptography Tricks Make a Hard Problem a Little Easier

Researchers have shown how to find the simplest description of a data set faster than by simply checking every possibility.

### Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more.

### Physicists Finally Find a Problem for Quantum Computers Alone

Researchers have shown that a problem relating to the energy of a quantum system is easy for quantum computers but hard for classical ones.

### New Breakthrough Brings Matrix Multiplication Closer to Ideal

By eliminating a hidden inefficiency, computer scientists have come up with a new way to multiply large matrices that’s faster than ever.

### Scientists Find Optimal Balance of Data Storage and Time

Seventy years after the invention of a data structure called a hash table, theoreticians have found the most efficient possible configuration for it.

### How to Build an Origami Computer

Two mathematicians have shown that origami can, in principle, be used to perform any possible computation.

### Researchers Approach New Speed Limit for Seminal Problem

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.

### The Year in Computer Science

Artificial intelligence learned how to generate text and art better than ever before, while computer scientists developed algorithms that solved long-standing problems.

### Celebrated Cryptography Algorithm Gets an Upgrade

Two researchers have improved a well-known technique for lattice basis reduction, opening up new avenues for practical experiments in cryptography and mathematics.