The following pages link to Pascal Tesson (Q476160):
Displaying 29 items.
- Conservative groupoids recognize only regular languages (Q476161) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- (Q870450) (redirect page) (← links)
- Dichotomies in the complexity of solving systems of equations over finite semigroups (Q870451) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Complete classifications for the communication complexity of regular languages (Q1771314) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- Conservative Groupoids Recognize Only Regular Languages (Q2890193) (← links)
- (Q3113761) (← links)
- (Q3396575) (← links)
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
- Tractable Clones of Polynomials over Semigroups (Q3524174) (← links)
- WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY (Q3561125) (← links)
- Languages with Bounded Multiparty Communication Complexity (Q3590958) (← links)
- An Algebraic Point of View on the Crane Beach Property (Q3613354) (← links)
- (Q4219022) (← links)
- (Q4407441) (← links)
- (Q4418637) (← links)
- (Q4536353) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- (Q4779171) (← links)
- (Q4807833) (← links)
- (Q4942276) (← links)
- Logic Meets Algebra: the Case of Regular Languages (Q5310680) (← links)
- Universal Algebra and Hardness Results for Constraint Satisfaction Problems (Q5428815) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
- Developments in Language Theory (Q5711979) (← links)
- Automata, Languages and Programming (Q5716803) (← links)
- Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture (Q5756693) (← links)
