Login / Signup
Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete.
Marco Voigt
Christoph Weidenbach
Published in:
CoRR (2015)
Keyphrases
</>
satisfiability problem
upper bound
highly reliable
pspace complete
lower bound
worst case
datalog programs
multiscale
multi agent systems
relational databases
provably correct