The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curricu...
In this article we approach neural networks as computational templates that travel across various sciences. Traditionally, it has been thought that models are primarily models of s...
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...