News
Algorithms and Complexity group news
Nature does not allow secure computation between rivals
It is impossible to devise a cryptographic system that guarantees secure computation between two rivals.
Decades-old P=NP 'proof' finally refuted
The traveling salesman problem is still unresolved. A 26 year old claim for a solution is finally fully refuted by researchers of Centrum Wiskunde & Informatica (CWI) in Amsterdam, Université libre de …
David García Soriano defends thesis on property testing
Whether they are analyzing the stock market, genes or search data, computer programs often need to process large amounts of data. Sometimes there isn't even have enough time to process all the …
Early genetic code very resistant to mutation
Researchers of Centrum Wiskunde & Informatica (CWI) in Amsterdam show that the genetic code is remarkably resistant to DNA replication errors. This might explain the success of the common ancestor of all …
Grothendieck applied to entanglement and optimization
Jop Briët, researcher at the Centrum Wiskunde & Informatica (CWI) in Amsterdam, introduces in his thesis new variations of Grothendieck’s inequality. He applied them to entanglement, an aspect of quantum mechanics, and …
Ronald de Wolf appointed Professor at University of Amsterdam
Position-based Quantum Cryptography, Impossibility and Constructions
CWI research helps predicting limit Moore's Law
- Button to the previous page
- 1
- …
- 8
- 9
- 10
- 11 (current)
- 12
- 13
- Button to the next page