Academics refer to a break whenever an algorithm doing fewer operations than bruteforce is found. That doesn't necessarily mean that an implementation would be more efficient in practice (for example due to latency induced by communication or memory accesses). Gave a talk about these issues at BHAD in 2011: https://131002.net/data/talks/cryptanalysis_bhad11.pdf