Results 21 to 30 of about 1,041,680 (279)
Proof complexity of positive branching programs [PDF]
Logical Methods in Computer ScienceWe investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes, there is also a 1-transition.
Anupam Das, Avgerinos Delkos
doaj +1 more source
Tractability Frontier of Data Complexity in Team Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We study the data complexity of model-checking for logics with team semantics. For dependence and independence logic, we completely characterize the tractability/intractability frontier of data complexity of both quantifier-free and quantified formulas ...
Arnaud Durand +3 more
doaj +1 more source
Quantum Proofs of Proximity [PDF]
Quantum, 2022 We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA $\textit{proofs of proximity}$ (QMAPs).
Marcel Dall'Agnol +3 more
doaj +1 more source
Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA
IEEE Access, 2022 We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals $K_{\mathrm{max}}^{a}$ is the ...
Michel Kulhandjian +5 more
doaj +1 more source
Feasible Interpolation for QBF Resolution Calculi [PDF]
Logical Methods in Computer Science, 2017 In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or ...
Olaf Beyersdorff +3 more
doaj +1 more source
Implementation and Optimization of Zero-Knowledge Proof Circuit Based on Hash Function SM3
Sensors, 2022 With the increasing demand for privacy protection in the blockchain, the universal zero-knowledge proof protocol has been developed and widely used. Because hash function is an important cryptographic primitive in a blockchain, the zero-knowledge proof ...
Yang Yang +7 more
doaj +1 more source
Space proof complexity for random 3-CNFs [PDF]
, 2017 We investigate the space complexity of refuting 3-CNFs in Resolution and algebraic systems. We prove that every Polynomial Calculus with Resolution refutation of a random 3-CNF φ in n variables requires, with high probability, distinct monomials to be ...
Bennett, Patrick +5 more
core +1 more source
Proofs of Proof-of-Stake with Sublinear Complexity
, 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. A malicious provider can mislead the wallet by faking payments and balances, or censoring transactions.
Agrawal, Shresth +3 more
openaire +4 more sources
Interaction and Depth against Nondeterminism in Proof Search [PDF]
Logical Methods in Computer Science, 2014 Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj +1 more source
Nondeterministic Instance Complexity and Proof Systems with Advice [PDF]
, 2009 Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Krajíček [1] have recently introduced the notion of propositional proof systems with advice.
H. Buhrman +9 more
core +2 more sources