##
###
Optimization problems with low SWaP tactical Computing
[article]

Mee Seong Im, Venkat R. Dasari, Lubjana Beshaj, Dale Shires

2019
*
arXiv
*
pre-print

In *a* resource-constrained, contested environment, computing resources need to be aware of possible size, weight, and power (SWaP) restrictions. ...
Due to these restrictions, only *a* small subset of less complicated and fast computable algorithms can be used for tactical, adaptive computing. ...
time complexity class, N P is the class of languages decidable in *polynomial* time on *a* nondeterministic *Turing* *machine*, PSpace is the class of decision problems solvable by *a* *Turing* *machine* using *a* *polynomial* ...

arXiv:1902.05070v1
fatcat:t3xyo62h3fbalal7p5yvno3pb4