Improving Legibility of Formal Proofs Based on the Close Reference Principle is NP-Hard.
Karol PakPublished in: J. Autom. Reason. (2015)
Keyphrases
- formal proofs
- np hard
- optimal solution
- np complete
- lower bound
- approximation algorithms
- worst case
- linear programming
- special case
- reference frame
- branch and bound algorithm
- mobile robot
- computationally challenging
- closely related
- real time
- dynamic programming
- artificial neural networks
- information technology
- artificial intelligence