The following pages link to Arnaud Durand (Q235688):
Displaying 43 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- Dependence logic with a majority quantifier (Q302214) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- First-order spectra with one binary predicate (Q1350533) (← links)
- Probabilistic team semantics (Q1647487) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- The expressive power of bijections over weakly arithmetized structures (Q2432541) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- Approximation and Dependence via Multiteam Semantics (Q2807084) (← links)
- Homomorphism polynomials complete for VP (Q2808529) (← links)
- Dependence logic with a majority quantifier (Q2911629) (← links)
- Enumeration complexity of logical query problems with second-order variables (Q2915682) (← links)
- Hierarchies in Dependence Logic (Q2946680) (← links)
- The arithmetic complexity of tensor contractions (Q2957898) (← links)
- Homomorphism Polynomials Complete for VP (Q2978539) (← links)
- Hypergraph Acyclicity and Propositional Model Counting (Q3192085) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- Efficient Enumeration for Conjunctive Queries over X-underbar Structures (Q3586035) (← links)
- On Acyclic Conjunctive Queries and Constant Delay Enumeration (Q3608414) (← links)
- First-Order Queries over One Unary Function (Q3613347) (← links)
- (Q4218932) (← links)
- Subclasses of binary NP (Q4399718) (← links)
- (Q4418672) (← links)
- (Q4474838) (← links)
- (Q4536368) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- (Q4941892) (← links)
- (Q5013879) (← links)
- Tractability Frontier of Data Complexity in Team Semantics (Q5056358) (← links)
- Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth (Q5145309) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- First-order queries on structures of bounded degree are computable with constant delay (Q5277786) (← links)
- Descriptive Complexity of #AC^0 Functions (Q5278406) (← links)
- On the complexity of recognizing the Hilbert basis of a linear Diophantine system (Q5958323) (← links)
- Enumeration classes defined by circuits (Q6584035) (← links)
- Modular SAT-based techniques for reasoning tasks in team semantics (Q6615313) (← links)
