Results 31 to 40 of about 5,071,272 (326)
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
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
Institutional complexity is complexity with an adjective
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle
core +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
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
Governing Complexity in World Politics
, 2021 Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core +1 more source
On the Proof Complexity of MCSAT
CoRR, 2019 SC-square 2019 : Satisfiability Checking and Symbolic Computation 2019 : Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry (SIAM AG 2019) : Bern, Switzerland, 10th July 2019 / Edited by John Abbott, Alberto Griggio 4th Workshop on Satisfiability Checking and Symbolic Computation, SC-square, Bern,
Gereon Kremer +2 more
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