来这真柔软
发表于 2025-3-28 16:31:37
http://reply.papertrans.cn/28/2720/271976/271976_41.png
尖牙
发表于 2025-3-28 21:44:20
Efficient algorithms for checking the atomicity of a run of read and write operations,able, known theorems lead to polynomial-time algorithms for checking the atomicity of a run (the variable of the time-complexity function is the number of operations in the run). It is then proved that checking atomicity has polynomial-time complexity in the general case of more than one variables a