Conversational recommendation: theoretical model and complexity analysis

DOI10.1016/j.ins.2022.07.169arXiv2111.05578OpenAlexW3214288248MaRDI QIDQ6125269

Francesco Maria Donini, Claudio Pomo, Fedelucio Narducci, Dietmar Jannach, Tommaso di Noia

Publication date: 11 April 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05578

zbMATH Keywords

complexity analysisconversational recommender systems

Mathematics Subject Classification ID

Computer science (68-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Totally optimal decision trees for Boolean functions
• Constructing optimal binary decision trees is NP-complete
• Exact learning when irrelevant variables abound
• Logical foundations of knowledge-based recommender systems: a unifying spectrum of alternatives
• Relationships between nondeterministic and deterministic tape complexities
• A note on succinct representations of graphs
• Optimal classification trees

This page was built for publication: Conversational recommendation: theoretical model and complexity analysis