~ similar to 2606.14167· 20 results
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…
The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…
The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…
The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…
The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…
The paper evaluates LLM reasoning on Boolean satisfiability (SAT) problems, concluding that conventional metrics are misleading and proposing a paired-formula protocol with Accurate Differentiation Ra…
This paper analyzes the computational complexity of verifying feedforward neural networks when their weights are restricted to finite-width arithmetic, finding that verification remains NP-complete fo…
The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).
This paper proves several properties about Extended Frege proof systems and circuit equivalence.
The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…
The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…
The paper proposes a hybrid SAT-solving framework that uses a probabilistic-bit (p-bit) Ising sampler to guide Conflict-Driven Clause-Learning (CDCL) solvers, significantly reducing internal search ef…
This paper establishes an unconditional barrier for AC0-natural proofs, showing that they cannot prove lower bounds greater than $2^{n^{7/(d-5)}}$ against depth-$d$ circuits.
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…
The paper proposes a novel space switching method to efficiently unify arithmetic and comparison operations within Fully Homomorphic Encryption (FHE) schemes, achieving significant performance improve…
The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking…
The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…
The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…
The paper presents a lattice-based Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme that supports $\mathsf{NC}^1$ access policies while maintaining constant-size ciphertexts.
This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…