Conquering Generals: an NP-Hard Proof of Useful Work.
Angelique Faye LoeElizabeth A. QuagliaPublished in: CRYBLOCK@MobiSys (2018)
Keyphrases
- np hard
- scheduling problem
- np complete
- approximation algorithms
- optimal solution
- special case
- lower bound
- branch and bound algorithm
- cost based abduction
- integer programming
- constraint satisfaction problems
- linear programming
- linear logic
- set cover
- np hardness
- closely related
- worst case
- decision problems
- upper bound
- artificial neural networks
- database systems
- decision trees
- proof theory
- minimum cost
- genetic algorithm
- logical rules
- real time
- remains np hard
- computationally hard
- theorem proving
- greedy algorithm
- knowledge base
- data sets