The following pages link to Yann Strozecki (Q385503):
Displaying 17 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- Computing the multilinear factors of lacunary polynomials without heights (Q2229711) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- (Q2911618) (← links)
- Approximate Verification and Enumeration Problems (Q2915109) (← links)
- Enumeration Complexity of Logical Query Problems with Second-order Variables (Q2915682) (← links)
- Factoring bivariate lacunary polynomials without heights (Q2963227) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- Enumeration of the Monomials of a Polynomial and Related Complexity Classes (Q3586118) (← links)
- (Q4601904) (← links)
- (Q5090455) (← links)
- (Q5207888) (← links)
- (Q5226843) (← links)
- Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games (Q5410636) (← links)
- (Q6168423) (← links)
