The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
We show how to approximate decision problems such as satisfiability of a formula by a structure, or Equivalence between two formulas, such that we gain an exponential factor (or more) in complexity. A typical case is to decide if two Non-deterministic automata are equivalent: we decide the approximate version in polynomial time whereas the exact version is PSPACE complete. For Pushdown automata, we decide the approximate version in exponential time whereas the exact version is undecidable.