Results 21 to 30 of about 156,901 (262)
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
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
Approximability and proof complexity [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 This work is concerned with the proof-complexity of certifying that optimization problems do \emph{not} have good solutions. Specifically we consider bounded-degree "Sum of Squares" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by Grigoriev and Vorobjov.
Ryan O'Donnell, Yuan Zhou 0007
openaire +2 more sources
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
On the Complexity of Branching Proofs
CoRR, 2020 We consider the task of proving integer infeasibility of a bounded convex $K$ in $\mathbb{R}^n$ using a general branching proof system. In a general branching proof, one constructs a branching tree by adding an integer disjunction $\mathbf{a} \mathbf{x} \leq b$ or $\mathbf{a} \mathbf{x} \geq b+1$, $\mathbf{a} \in \mathbb{Z}^n$, $b \in \mathbb{Z}$, at ...
Dadush, Daniel, Tiwari, Samarth
openaire +4 more sources
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
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
On the proof complexity of deep inference [PDF]
ACM Transactions on Computational Logic, 2009 We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; (2) there are analytic deep-inference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that ...
Paola Bruscoli, Alessio Guglielmi
openaire +2 more sources
Separations in Proof Complexity and TFNP
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 It is well-known that Resolution proofs can be efficiently simulated by Sherali–Adams (SA) proofs. We show, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the coefficients are written in unary.
Mika Göös +6 more
openaire +4 more sources
IEEE Access, 2022 The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent
Yanhe Na +4 more
doaj +1 more source