Results 11 to 20 of about 5,071,272 (326)
Proofs of Proof-of-Stake with Sublinear Complexity [PDF]
CoRR, 2022 Popular Ethereum wallets (like MetaMask) entrust centralized infrastructure providers (e.g., Infura) to run the consensus client logic on their behalf. As a result, these wallets are light-weight and high-performant, but come with security risks.
Shresth Agrawal +3 more
semanticscholar +6 more sources
Proof Complexity of Substructural Logics [PDF]
Annals of Pure and Applied Logic, 2020 In this paper, we investigate the proof complexity of a wide range of substructural systems. For any proof system $\mathbf{P}$ at least as strong as Full Lambek calculus, $\mathbf{FL}$, and polynomially simulated by the extended Frege system for some ...
Raheleh Jalali
semanticscholar +5 more sources
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such as equality and
Or Meir +4 more
semanticscholar +3 more sources
Proof Complexity Meets Algebra [PDF]
ACM Transactions on Computational Logic, 2017 We analyze how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semialgebraic proof systems, the classical constructions of pp ...
Albert Atserias, Joanna Ochremiak
semanticscholar +9 more sources
The Proof Complexity of SMT Solvers
International Conference on Computer Aided Verification, 2018 The resolution proof system has been enormously helpful in deepening our understanding of conflict-driven clause-learning (\(\mathsf {CDCL}\)) SAT solvers.
Robert Robere +2 more
semanticscholar +2 more sources
Proof Complexity Lower Bounds from Algebraic Circuit Complexity [PDF]
Electron. Colloquium Comput. Complex., 2016 We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi, where the circuits comprising the proof come from various restricted algebraic circuit classes.
Michael A. Forbes +3 more
semanticscholar +3 more sources
Proof of a momentum/complexity correspondence [PDF]
Physical Review D, 2020 We show that the holographic Complexity = Volume proposal satisfies a very general notion of Momentum/Complexity correspondence (PC), based on the Momentum Constraint of General Relativity.
J. L. F. Barbón +2 more
semanticscholar +6 more sources
Proof Complexity of Modal Resolution. [PDF]
J Autom Reason, 2022 AbstractWe investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3–4):117–134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods—24th international conference, (TABLEAUX’15), pp 185–200, 2015), which form the basis of modal theorem proving (Nalon et al., in ...
Sigley S, Beyersdorff O.
europepmc +4 more sources
Parameterized Proof Complexity [PDF]
computational complexity, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan S. Dantchev +2 more
openaire +2 more sources