搜索结果: 1-1 共查到“运筹学 Equivalence”相关记录1条 . 查询时间(0.031 秒)
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.