Login / Signup
The Complexity of Bounded Quantifiers in Some Ordered Abelian Groups.
Philip Scowcroft
Published in:
Notre Dame J. Formal Log. (2007)
Keyphrases
</>
worst case
natural language
computational complexity
computational cost
database
real time
information systems
image segmentation
evolutionary algorithm
hidden markov models
mobile robot
first order logic
tree patterns