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

20 results for “Meta-complexity”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.CCcs.LOTheoreticalRecentOct 24, 2026

Meta-Mathematics of Algebraic Complexity

Michal Garlik, Svyatoslav Gryaznov, Jiaqi Lu, Rahul Santhanam +1 more

The paper studies the meta-mathematics of algebraic circuit lower bounds and their relationship with proof systems and bounded arithmetic theories.

View →
cs.CCTheoreticalRecentJul 8, 2026

Fixed Points, a Predictor-Impossibility Theorem, and Applications

Tom Altman

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →
cs.CCcs.DMTheoreticalRecentJul 9, 2026

The Parameterised Complexity of Temporal Motif Counting, and a Lovász-Style Isomorphism Theorem

Jayakrishnan Madathil, Kitty Meeks, Marc Roth

This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…

View →
cs.CCTheoreticalRecentAug 6, 2026

Predictor-Impossibility Theorem and Applications

Tom Altman

This paper introduces a hierarchy and proves a Predictor Impossibility Theorem, defining an aggregate language MIS and establishing a connection between aggregate inputs and individual stage languages…

View →
cs.LOcs.CCTheoreticalRecentJun 15, 2026

Revisiting average case complexity of multilevel syllogistic: From the 1995 Courant Technical Report to Lean 4 Formalization

Lars Warren Ericson

The paper revisits the average-case complexity of Multilevel Syllogistic (MLS) and provides a formalization in Lean 4.

View →
cs.AIRecentMay 28, 2026

Meta-Programming for Linear-time Temporal Answer Set Programming

Susana Hahn, Amade Nems, Javier Romero, Torsten Schaub

The paper proposes a flexible meta-programming framework to declaratively operationalize and explore varied temporal logics, such as TEL, MEL, and DEL, within standard Answer Set Programming systems.

View →
cs.FLcs.CCTheoreticalRecentJun 30, 2026

Complexity of Universality and Related Decision Problems for Unary Two-Dimensional Automata

Taylor J. Smith

This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.

View →
cs.LGcs.AIcs.CVRecentMay 30, 2026

On the Difficulty of Learning a Meta-network for Training Data Selection

Zilin Du, Junqi Zhao, Boyang Albert Li

This paper analyzes the poor performance of Meta-learning for Training-data Selection (MTS) and proposes that increasing the batch size and incorporating informative features can significantly improve…

View →
cs.CCcs.DMcs.DSRecentJun 1, 2026

$O(n +f(k))$: Truly Linear FPT

Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright +6 more

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

View →
cs.AIcs.NEEmpiricalRecentOct 16, 2026

Algorithm Modelization: Transforming Optimization Algorithms into Evolvable Intelligence

Jian Yao, Zhiyao Zhang, Yichen Li, Xingyu Wu +1 more

This paper introduces Algorithm Modelization, a paradigm that turns iterative algorithms into trainable models.

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.PLTheoreticalRecentOct 30, 2026

Iris on Indirection Theory: Lightweight Higher-order Ghost State

Darius Foo, Viet-Anh Nguyen, Wei-Ngan Chin

This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.

View →
cs.FLcs.DMTheoreticalRecentJun 9, 2026

On the Complexity of the Bi-infinite Post Correspondence Problem

Olivier Finkel, Vesa Halava

This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.

View →
cs.AIEmpiricalRecentSep 29, 2026

Thinking Before Thinking: Scaling Agentic Inference Through Meta-Reasoning

Paras Dahal, Anton Bakhtin, Taco Cohen, Zhengxing Chen +8 more

The paper introduces agentic meta-reasoning, a structured reasoning process for controlling the execution of complex tasks.

View →