No article text was recorded for this version.
lack of empirical evaluation (theoretical focus)
Version 1 of 1145 papers146 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Parameterized Study of Maximum Generalized Pattern Matching Problems
- Blog: Augmenting Concept Languages by Transitive Closure of Roles: An
- Blog: The Ins
- Blog: Parameterized Algorithms for List K-Cycle
- Blog: Theoretical formulation and analysis of the deterministic dendritic cell algorithm
- Blog: Complexity of Representation and Inference in Compositional Models with Part Sharing
- Blog: Exact complexity of Exact-Four-Colorability
- Blog: Note on Cyclically Interval Edge Colorings of Simple Cycles
- Blog: String Factorizations Under Various Collision Constraints
- Blog: Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Blog: On a restricted linear congruence
- Blog: Generating massive complex networks with hyperbolic geometry faster in practice
- Blog: On exact Reznick, Hilbert-Artin and Putinar's representations
- Blog: Log-Barrier Interior Point Methods Are Not Strongly Polynomial
- Blog: A smoothing SQP framework for a class of composite Lq minimization over polyhedron
- Blog: Existential Length Universality
- Blog: New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
- Blog: Connecting the Dots (with Minimum Crossings)
- Blog: Proving inequalities and solving global optimization problems via simplified CAD projection
- Blog: A Representation for Efficient Temporal Reasoning
- Blog: An improved algorithm for computing the volume of the union of cubes
- Blog: On solution discovery via reconfiguration
- Blog: Distributed Statistical Estimation of Matrix Products with Applications
- Blog: Tight Hardness of the Non-Commutative Grothendieck Problem
- Blog: A nearly optimal algorithm to decompose binary forms
- Blog: On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets
- Blog: \(\mathcal{P}\)-Matchings Parameterized by Treewidth
- Blog: Robust Blockwise Random Pivoting: Fast and Accurate Adaptive Interpolative Decomposition
- Blog: An efficient parameterized algorithm for m-set packing
- Blog: Memory Complexity of Estimating Entropy and Mutual Information
- Blog: Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds
- Blog: An O(nlog n)-Time Algorithm for the k-Center Problem in Trees
- Blog: Lifespan functors and natural dualities in persistent homology
- Blog: Triangle Estimation Using Tripartite Independent Set Queries
- Blog: Forgetting Auxiliary Atoms in Forks (Extended Abstract)
- Blog: Causes for Query Answers from Databases, Datalog Abduction and View-Updates: The Presence of Integrity Constraints
- Blog: The Complexity of Nested Counterfactuals and
- Blog: On Reasoning with Ambiguities
- Blog: Monochromatic Triangles, Intermediate Matrix Products, and Convolutions
- Blog: Analogy Between Concepts (Extended Abstract)
- Blog: Improving TSP Tours Using Dynamic Programming over Tree Decompositions
- Blog: On the Complexity of Bounded Context Switching
- Blog: Dimensions of Copeland-Erdos Sequences
- Blog: Fine-Grained Complexity and Algorithms for the Schulze Voting Method
- Blog: On the Complexity of the Core over Coalition Structures
- Blog: The Learning and Communication Complexity of Subsequence Containment
- Blog: Improper Learning by Refuting
- Blog: Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Blog: 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms
- Blog: Discrete Morse Theory for Computing Cellular Sheaf Cohomology
- Blog: Simple Complexity Analysis of Direct Search
- Blog: Recognizing Read-Once Functions from Depth-Three Formulas
- Blog: A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
- Blog: Automata-Based Stream Processing
- Blog: Listing Subgraphs by Cartesian Decomposition
- Blog: Sparsity regret bounds for individual sequences in online linear regression
- Blog: Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation
- Blog: On the Hierarchical Community Structure of Practical Boolean Formulas
- Blog: Cotorsion torsion triples and the representation theory of filtered hierarchical clustering
- Blog: The Complexity of Reasoning for Fragments of Autoepistemic Logic
Showing 60 of 145 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_lack_of_empirical_evaluation_theoretical_c2a0ab25,
title = {lack of empirical evaluation (theoretical focus)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lack-of-empirical-evaluation-theoretical-focus/rdr_c2a0ab25420f46c3a72f8b67c78e177a},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_lack_of_empirical_evaluation_theoretical_c2a0ab25_v1,
title = {lack of empirical evaluation (theoretical focus)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lack-of-empirical-evaluation-theoretical-focus/rdr_c2a0ab25420f46c3a72f8b67c78e177a/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}