发明名称 SOLVING NP-COMPLETE PROBLEMS WITHOUT HYPER-POLYNOMIAL COST
摘要 Within satisfaction problems or any decision or other problem which is reducible to a satisfaction problem, the invention tracks the paths along which implications propagate and identifies conditional contradictions and subsequently moves the contradictions back down the implicational paths toward assumptions or other unreasoned assertions in order to expel the contradictions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems. Such problems are addressed by devices, software, and processes related to many technical fields, including: ore refining; pipeline routing; yarn manufacture; fabric cutting; sawyering; mechanical component design; structural design of data processing systems; design and analysis of circuits or semiconductor masks; inspection and guarding of containers, pipes, and galleries; sensor array operations; orbital satellite operations; data compression; chemical analysis; design and analysis of proteins.
申请公布号 CA2943044(A1) 申请公布日期 2015.10.01
申请号 CA20152943044 申请日期 2015.03.25
申请人 GILLESPIE, CLAYTON 发明人 GILLESPIE, CLAYTON
分类号 G06F17/10 主分类号 G06F17/10
代理机构 代理人
主权项
地址