Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Remshagen, Anja - Department of Computer Science, University of West Georgia
On the Complexity of the CQF Hierarchy Anja Remshagen
LEARNING FOR SAT AND MINSAT, AND ALGORITHMS FOR QUANTIFIED SAT AND MINSAT
An Effective Algorithm for the Futile Questioning Anja Remshagen and Klaus Truemper
Local Search for Quantified Boolean Formulas University of West Georgia
A SAT-based Solver for Q-ALL SAT B. Browning
An Effective QBF Solver for Planning Problems Charles Otwell1
On the Graph-Density of Random 0/1-Polytopes Volker Kaibel1
Das MaxCutProblem in Graphen mit konstantem Geschlecht und beschr ankten
The Complexity of Futile Questioning Anja Remshagen
