Admissible closures of polynomial time computable arithmetic.

Dieter Probst Thomas Strahm

Published in: Arch. Math. Log. (2011)

Keyphrases

finite sets
turing machine
special case
approximation algorithms
dnf formulas
worst case
databases
floating point
search algorithm
transitive closure
np hardness
piecewise linear
arithmetic operations
approximation ratio
computational complexity
multiscale
genetic algorithm