|
Search the dblp DataBase
Anja Remshagen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ben Browning, Anja Remshagen
A SAT-based solver for Q-ALL SAT. [Citation Graph (0, 0)][DBLP] ACM Southeast Regional Conference, 2006, pp:30-33 [Conf]
- N. Hristov, Anja Remshagen
Local search for quantified Boolean formulas. [Citation Graph (0, 0)][DBLP] ACM Southeast Regional Conference (1), 2005, pp:116-120 [Conf]
- Charles Otwell, Anja Remshagen, Klaus Truemper
An Effective QBF Solver for Planning Problems. [Citation Graph (0, 0)][DBLP] MSV/AMCS, 2004, pp:311-316 [Conf]
- Volker Kaibel, Anja Remshagen
On the Graph-Density of Random 0/1-Polytopes. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:318-328 [Conf]
- Anja Remshagen, Klaus Truemper
Learning in a Compiler for MINSAT Algorithms [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Anja Remshagen, Klaus Truemper
An Effective Algorithm for the Futile Questioning Problem. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2005, v:34, n:1, pp:31-47 [Journal]
- Anja Remshagen, Klaus Truemper
Learning in a Compiler for MINSAT Algorithms. [Citation Graph (0, 0)][DBLP] TPLP, 2003, v:3, n:3, pp:271-286 [Journal]
The Complexity of Futile Questioning. [Citation Graph (, )][DBLP]
An Alternative Representation for QBF. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|