The following pages link to Bruno Zanuttini (Q253987):
Displayed 17 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- A note on some collapse results of valued constraints (Q987814) (← links)
- Learning conditional preference networks (Q991013) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets (Q3061124) (← links)
- (Q3455569) (← links)
- Efficient Algorithms for Description Problems over Finite Totally Ordered Domains (Q3631897) (← links)
- (Q4434165) (← links)
- (Q4737597) (← links)
- Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms (Q4922904) (← links)
- Automated Reasoning (Q5307063) (← links)
- A Complete Classification of the Complexity of Propositional Abduction (Q5470752) (← links)
- Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Q5741801) (← links)