Travelled to:1 × Italy
3 × USA
Collaborated with:E.Speckenmeyer S.Porschen E.Boros P.L.Hammer A.Kogan K.Makino B.Simeone O.Cepek
Talks about:satisfi (2) problem (2) linear (2) time (2) algorithm (1) formula (1) formul (1) level (1) graph (1) equal (1)
Person: Bert Randerath
DBLP: Randerath:Bert
Contributed to:
2006200320022001Wrote 4 papers:
- SAT-2006-PorschenSR #linear #on the
- On Linear CNF Formulas (SP, ES, BR), pp. 212–225.
- SAT-2003-PorschenRS #algorithm #linear #problem #satisfiability
- Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
- SAT-2002-PorschenRS #decidability #satisfiability
- X3SAT is decidable in time O(2n/5) (SP, BR, ES), p. 10.
- SAT-2001-RanderathSBHKMSC #graph #problem #satisfiability
- A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.