{"total":16,"rows":[{"id":"2105.14835","title":"Towards Lower Bounds on the Depth of ReLU Neural Networks","created":"2021-05-31","cited_by_count":56,"area":null},{"id":"2204.01368","title":"Training Fully Connected Neural Networks is $\\exists\\mathbb{R}$-Complete","created":"2022-04-04","cited_by_count":15,"area":null},{"id":"2102.06635","title":"ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation","created":"2021-02-12","cited_by_count":12,"area":null},{"id":"2502.09324","title":"Depth-Bounds for Neural Networks via the Braid Arrangement","created":"2025-02-13","cited_by_count":11,"area":null},{"id":"2410.04907","title":"Decomposition Polyhedra of Piecewise Linear Functions","created":"2024-10-07","cited_by_count":9,"area":null},{"id":"2411.03006","title":"Neural Networks and (Virtual) Extended Formulations","created":"2024-11-05","cited_by_count":9,"area":null},{"id":"2311.07633","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","created":"2023-11-13","cited_by_count":8,"area":null},{"id":"2310.05309","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","created":"2023-10-08","cited_by_count":5,"area":null},{"id":"2502.16763","title":"Learning to Add, Multiply, and Execute Algorithmic Instructions Exactly with Neural Networks","created":"2025-02-24","cited_by_count":4,"area":null},{"id":"2511.02406","title":"Arithmetic Circuits and Neural Networks for Regular Matroids","created":"2025-11-04","cited_by_count":2,"area":null},{"id":"2312.06901","title":"Unsupervised Extractive Summarization with Learnable Length Control Strategies","created":"2023-12-12","cited_by_count":1,"area":null},{"id":"2410.15601","title":"All You Need is an Improving Column: Enhancing Column Generation for Parallel Machine Scheduling via Transformers","created":"2024-10-21","cited_by_count":1,"area":null},{"id":"2509.15239","title":"KNARsack: Teaching Neural Algorithmic Reasoners to Solve Pseudo-Polynomial Problems","created":"2025-09-17","cited_by_count":1,"area":null},{"id":"2312.03413","title":"Approximating Solutions to the Knapsack Problem using the Lagrangian Dual Framework","created":"2023-12-06","cited_by_count":0,"area":null},{"id":"2510.14068","title":"On the expressivity of sparse maxout networks","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2607.11540","title":"Tropical Circuits with Scalar Multiplication Gates","created":"2026-07-13","cited_by_count":0,"area":null}],"next_cursor":null}