Theoretical Computer Science
David Monniaux's user avatar
David Monniaux's user avatar
David Monniaux's user avatar
David Monniaux
  • Member for 11 years, 6 months
  • Last seen more than a week ago
Profile Activity

11 Questions

Score Activity Newest Views
14 votes
3 answers
1k views

Proof of undecidability not by reduction from the halting problem

13 votes
1 answer
731 views

Complexity of the problem of words with fewest distinct letters accepted by a finite automaton

10 votes
1 answer
280 views

Algorithms on graphs represented using BDDs

9 votes
0 answers
125 views

Complexity of checking the equivalence of constraints and generator descriptions of convex polyhedra

8 votes
1 answer
202 views

Decidability of inductive invariant existence in Presburger arithmetic

8 votes
0 answers
160 views

Practical interactive proof schemes for NP-hard problems

7 votes
1 answer
345 views

Reaching the double exponential upper bound in Fourier-Motzkin elimination

6 votes
1 answer
143 views

Complexity of maximizing the number of models in a parametric formula

6 votes
1 answer
203 views

What is known about $\mathrm{NP}^{\mathrm{PP}[1]}$?

6 votes
4 answers
447 views

Simplification of Presburger formulas in practice

0 votes
0 answers
85 views

Complexity of projected model counting

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.