20 results for “Meta-complexity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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…
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
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…
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…
The paper revisits the average-case complexity of Multilevel Syllogistic (MLS) and provides a formalization in Lean 4.
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.
This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.
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…
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…
Jian Yao, Zhiyao Zhang, Yichen Li, Xingyu Wu +1 more
This paper introduces Algorithm Modelization, a paradigm that turns iterative algorithms into trainable models.
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…
This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.
This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.
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.