Results 1 to 10 of about 236,217 (313)
Proofs of Proof-of-Stake with Sublinear Complexity [PDF]
IACR Cryptology ePrint Archive, 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 +5 more sources
Complexity of Semi-algebraic Proofs [PDF]
Moscow Mathematical Journal, 2002 Summary: It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász-Schrijver calculi (LS) utilizing quadratic inequalities.
D. Grigoriev, E. Hirsch, D. Pasechnik
semanticscholar +8 more sources
On the Herbrand content of LK [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite language of first ...
Bahareh Afshari +2 more
doaj +5 more sources
On the logical complexity of cyclic arithmetic [PDF]
Logical Methods in Computer Science, 2020 We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n$ for (the logical consequences of) cyclic proofs containing only $\
Anupam Das
doaj +3 more sources
On the relative proof complexity of deep inference via atomic flows [PDF]
Logical Methods in Computer Science, 2015 We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Anupam Das
doaj +5 more sources
Quantum interactive proofs and the complexity of entanglement detection [PDF]
Theory of Computing, 2013 This paper identifies a formal connection between physical problems related to entanglement detection and complexity classes in theoretical computer science.
Kevin Milner +3 more
semanticscholar +6 more sources
The Knowledge Complexity of Interactive Proof Systems [PDF]
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85, 1989 Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the ...
S. Goldwasser, S. Micali, C. Rackoff
semanticscholar +2 more sources
Complexity of Propositional Proofs Under a Promise [PDF]
ACM Transactions on Computational Logic, 2010 . We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where “many ” stands for an explicitly ...
Dershowitz, Nachum, Tzameret, Iddo
core +6 more sources
Proofs of Proofs of Work with Sublinear Complexity
Financial Cryptography Workshops, 2016 In the setting of blockchain based transaction ledgers we study the problem of “simplified payment verification” (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some ...
A. Kiayias +2 more
semanticscholar +3 more sources
Ranking Functions for Size-Change Termination II [PDF]
Logical Methods in Computer Science, 2009 Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs".
Amir M. Ben-Amram, Chin Soon Lee
doaj +4 more sources