ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Problem-solving”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.HCEmpiricalRecentJun 16, 2026

ParaTutor: LLM Mediated Parent Child Tutoring through Role Separated Scaffolding Interface in Real Time

Lan Luo, Anqi Wang, Muzhi Zhou, Junhua Zhu +3 more

This paper presents a system called ParaTutor that supports parent-child tutoring with LLMs, preserving the distinct roles of parents and children.

View →
cs.CLEmpiricalRecentJun 19, 2026

PeerMathDial: A Middle School Dialogue Dataset for Student Collaborative Math Problem Solving

Murong Yue, Desmond Alexander Mcglone, Emily Slutz, Wenhan Lyu +3 more

The paper introduces a new dataset, PeerMathDial, of peer collaborative problem-solving dialogues in middle school math classrooms.

View →
cs.SEcs.AIEmpiricalRecentJun 11, 2026

Beyond Problem Solving: UOJ-Bench for Evaluating Code Generation, Hacking, and Repair in Competitive Programming

Tingqiang Xu, Hangrui Zhou, Tianle Cai, Alex Gu +1 more

The authors introduce UOJ-Bench, a benchmark to evaluate Large Language Models' ability to identify errors in human-written code.

View →
cs.CLRecentMay 30, 2026

IDEAFix: Evaluation Framework for Creative Defixation Prompting in LLMs

F. Carichon, S. Sharma, M. Girard, R. Rampa +1 more

The paper introduces IDEAFix, a systematic evaluation framework designed to analyze how structured prompting and task design influence the divergent thinking and originality of idea generation in LLMs…

View →
cs.CCTheoreticalRecentJul 24, 2026

Ice Walk is ASP-Complete

Papangkorn Apinyanon

The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…

View →
cs.DMcs.DSTheoreticalRecentJul 7, 2026

Sudoku Grids That Require Many Clues

David Eppstein, Xinyu, Zhang

This paper proves that a majority of filled-in Sudoku grids require a logarithmic fraction of cells to be filled by clues, and constructs grids requiring 18 and 80 clues for 9x9 and 16x16 Sudoku, resp…

View →
cs.AIcs.CEcs.ETEmpiricalRecentJun 11, 2026

LLM-as-an-Investigator: Evidence-First Reasoning for Robust Interactive Problem Diagnosis

Fabrizio Marozzo, Pietro Liò

The paper introduces LLM-as-an-Investigator, an evidence-first agentic AI methodology for robust problem diagnosis.

View →
math.COcs.CCTheoreticalRecentJul 9, 2026

Polynomial Binary Optimization

Endre Boros

The paper develops an explicit multi-linear polynomial form for binary polynomial optimization problems after eliminating a subset of variables, allowing for characterization of new special classes wi…

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
cs.AIcs.LGRecentMay 27, 2026

Tree of Thoughts as a Classical Heuristic Search Problem: Formal Foundations and Design Patterns

Guni Sharon

This paper unifies the fragmented field of Tree-of-Thoughts (ToT) reasoning by mapping LLM-based search processes onto a formal taxonomy derived from classical heuristic search theory.

View →
cs.AIRecentMay 28, 2026

Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts (Extended Version)

João Filipe, Álvaro Torralba, Gregor Behnke

This paper investigates various methods for encoding factored tasks, a compact planning representation, into propositional logic for use with SAT solvers, analyzing the impact of encoding choices and…

View →
cs.CLcs.AIEmpiricalRecentJul 17, 2026

Frontier AI performance across the business disciplines: a case-grounded benchmark of knowledge work and analytical reasoning

Ajay Patel, Kartik Hosanagar, Ramayya Krishnan, Chris Callison-Burch +2 more

The paper introduces BusinessCaseBench, a benchmark for measuring AI performance on analytical knowledge work using business cases and grading rubrics.

View →
cs.HCTheoreticalRecentJun 23, 2026

A Dynamic Coupling Theory of Expertise Through Thinking Flow and Workflow Evolution

Annie Yuan

This paper proposes Workflow Cognition as a theoretical framework for explaining expertise as a dynamic cognitive phenomenon.

View →
cs.MAcs.AIcs.LGTheoreticalRecentOct 20, 2026

Local Work, Global Progress: A Convergence Theory of AI Agent Collaboration

Ivan Ilin, Peter Richtárik

The paper formalizes collaborative problem solving as block optimization and proves linear convergence for teams of large language model agents.

View →
cs.CYcs.AIcs.LGEmpiricalRecentJul 21, 2026

Assessment in Team Problem-Solving Exercises in Computing Education

Valdemar Švábenský, Jan Vykopal, Sukrit Leelaluk, Pavel Čeleda +2 more

This paper compares two methods for assessing student teams in tabletop exercises using data from learning platforms and evaluates their validity and reliability.

View →
cs.NEEmpiricalRecentJul 23, 2026

Search Hardness-Aware LLM-Based Problem Formulation for Expensive Simulation-Driven Design

Yuchen Li, Handing Wang, Bing Xue, Mengjie Zhang

This paper proposes SHA-PF, a search hardness-aware LLM-based problem formulation framework for expensive simulation-driven design, which prioritizes rare samples with greater progress potential and r…

View →