The complexity of such communication relates to Brooks' law, and it is also described by Eric S. Raymond, "Brooks predicts that as your number of programmers N rises, work performed scales as N but complexity and vulnerability to bugs rises as N-squared. N-squared tracks the number of communications paths (and potential code interfaces) between developers' code bases." —"The Revenge of the Hackers" （页面存档备份，存于互联网档案馆）. 2000.
web.archive.org
The complexity of such communication relates to Brooks' law, and it is also described by Eric S. Raymond, "Brooks predicts that as your number of programmers N rises, work performed scales as N but complexity and vulnerability to bugs rises as N-squared. N-squared tracks the number of communications paths (and potential code interfaces) between developers' code bases." —"The Revenge of the Hackers" （页面存档备份，存于互联网档案馆）. 2000.
