The following pages link to Florent Capelli (Q290897):
Displaying 16 items.
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
- Knowledge compilation languages as proof systems (Q2181922) (← links)
- Incremental delay enumeration: space and time (Q2274091) (← links)
- (Q2954991) (← links)
- The arithmetic complexity of tensor contractions (Q2957898) (← links)
- Hypergraph Acyclicity and Propositional Model Counting (Q3192085) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- (Q5090465) (← links)
- (Q5144668) (← links)
- Linear Programs with Conjunctive Database Queries (Q6151558) (← links)
- Linear programs with conjunctive queries (Q6491014) (← links)
- Linear programs with conjunctive queries (Q6492711) (← links)
- Geometric amortization of enumeration algorithms (Q6615120) (← links)
