5 citations · 15 across the 23 of their papers we have counts for
1 paper · 1 filter
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport +1
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains…