Computer Science
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
HP re-releases classic computer science calculator: The HP-16C
| Best used for: | Programming; Computer science; Logic design; Engineering | | Entry-system logic: | RPN (Reverse Polish Notation) | | Keyboard: | Numeric, with dedicated base mode keys (HEX, DEC, OCT, BIN) | | Advanced functions: | Integer arithmetic, bitwise operations, logical tests, base conversions (HEX/DEC/OCT/BIN), word-size control (1–64 bits), floating-point math, keystroke programming, conditional branching, subroutines, flags | | Memory registers: | 99 | | Program memory: | 203 B...
A Comparative Study of Student Perspectives on Technical Writing Feedback Quality: Evaluating LLMs, SLMs, and Humans in Computer Science Topics
arXiv:2601.11541v2 Announce Type: replace Abstract: To address the scalability of feedback in computer science while mitigating the privacy and cost limitations of commercial Large Language Models (LLMs), this study evaluates a locally hosted Small Language Model (SLM). We deployed a quantized Llama-3.1, GPT-4, and human instructors across introductory programming (N=176), operating systems (N=80), and a writing seminar (N=7). Mixed-methods analysis of student perceptions reveals that while...
No, Cake Cutting Really is a Piece of Cake
Computer Science > Computer Science and Game Theory [Submitted on 5 Jun 2026] Title:No, Cake Cutting Really is a Piece of Cake View PDF HTML (experimental)Abstract:We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts. References & Citations Loading...
Nonlinear Arithmetic with SMTLIB Division is Undecidable
Computer Science > Logic in Computer Science This paper has been withdrawn by Dejan Jovanovic [Submitted on 25 May 2026 (v1), last revised 2 Jun 2026 (this version, v2)] Title:Nonlinear Arithmetic with SMTLIB Division is Undecidable
Nonlinear Arithmetic with SMTLIB Division is Undecidable
Computer Science > Logic in Computer Science [Submitted on 25 May 2026 (v1), last revised 3 Jun 2026 (this version, v3)] Title:Nonlinear Arithmetic with SMTLIB Division is Undecidable View PDF HTML (experimental)Abstract:We show that the nonlinear real arithmetic theory (NRA) as defined in the SMTLIB standard is undecidable.
Abduction Prover in Isabelle/HOL
Computer Science > Logic in Computer Science [Submitted on 3 Jun 2026] Title:Abduction Prover in Isabelle/HOL View PDFAbstract:Proof assistants based on expressive logics suffer limited automation for proof search, raising the cost of formal verification based on proof assistants. We address this problem by introducing the Abduction Prover for Isabelle/HOL.
Formalizing multi-graded Brenner-Schr\"oer Proj schemes and dilatations of rings in Lean4
Computer Science > Logic in Computer Science [Submitted on 31 May 2026] Title:Formalizing multi-graded Brenner-Schröer Proj schemes and dilatations of rings in Lean4 View PDFAbstract:We present a detailed formalization in Lean4 of some multigraded algebraic geometry constructions, focusing on the Brenner--Schröer Proj construction and algebraic dilatations of rings. References & Citations Loading...
Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing
arXiv:2606.03919v1 Announce Type: new Abstract: Understanding and anticipating scientific change requires models that distinguish between endogenous consolidation and exogenous diffusion of scientific concepts. Using the quantum computing subtree of concepts in OpenAlex, we construct a temporally resolved concept co-occurrence network and track each concept pair through its upstream citation lineage and downstream diffusion.
Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing
arXiv:2606.03919v1 Announce Type: cross Abstract: Understanding and anticipating scientific change requires models that distinguish between endogenous consolidation and exogenous diffusion of scientific concepts. Using the quantum computing subtree of concepts in OpenAlex, we construct a temporally resolved concept co-occurrence network and track each concept pair through its upstream citation lineage and downstream diffusion. We train LightGBM models on distributional and diversity-aware...
RedZeD: Computing persistent homology by Reduction to Zero Differentials
Computer Science > Computational Geometry [Submitted on 4 Jun 2026] Title:RedZeD: Computing persistent homology by Reduction to Zero Differentials View PDF HTML (experimental)Abstract:We introduce a new algorithm for computing persistent homology of Vietoris--Rips filtrations, which in many cases offers a considerable speedup over the existing implementation of the persistence pairing algorithm. The key innovation, called active enumeration, is made possible by a new theoretical framework of...