"Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete."

Marco Voigt, Christoph Weidenbach (2015)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics