User David Monniaux - Theoretical Computer Science Stack Exchange

David Monniaux

Member for 11 years, 3 months
Last seen this week

Stats

1,122

reputation

5k

reached

7

answers

11

questions

Loading…

Communities

About

Computer science researcher at CNRS / VERIMAG

Publications https://cv.archives-ouvertes.fr/david-monniaux

Badges

View all badges

This user doesn’t have any gold badges yet.

5

silver badges

Yearling

× 5

Feb 6, 2022

16

bronze badges

Self-Learner

Feb 23, 2022
Curious

May 18, 2017
Announcer

Jun 4, 2012

Top tags

counting-complexity

8

Score

5

Posts

28

Posts %

lo.logic

3

Score

4

Posts

22

Posts %

cc.complexity-theory

3

Score

2

Posts

11

Posts %

graph-algorithms

3

Score

1

Posts

6

Posts %

sat

2

Score

2

Posts

11

Posts %

type-theory

2

Score

1

Posts

6

Posts %

Top posts

View all questions and answers

All Questions Answers

Score Newest

14

Proof of undecidability not by reduction from the halting problem

Apr 3, 2014

13

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

Dec 19, 2017

10

Algorithms on graphs represented using BDDs

Jun 2, 2012

9

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

May 17, 2017

8

Decidability of inductive invariant existence in Presburger arithmetic

Apr 7, 2014

8

Practical interactive proof schemes for NP-hard problems

Feb 26, 2018

7

Reaching the double exponential upper bound in Fourier-Motzkin elimination

Apr 3, 2018

6

Complexity of maximizing the number of models in a parametric formula

Jan 29, 2022

6

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

Jan 31, 2022

6

Simplification of Presburger formulas in practice

Feb 27, 2014

Top network posts

View all network posts

19

Efficient ways to anonymize a document

17

Hash-consing in F# and weak hash tables in .net

15

Optional ornament

13

η-expansion in a pure functional language

12

Impredicative polymorphism in F#