Results 21 to 30 of about 5,071,272 (326)
Complexity of Semialgebraic 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.
Grigoriev, D, Hirsch, E, Pasechnik, D
openaire +8 more sources
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience
Entropy, 2022 Probabilistically Checkable Proofs (PCPs) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x∈L” by querying only a few proof bits.
Mor Weiss
doaj +1 more source
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic [PDF]
Logical Methods in Computer Science, 2023 Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a third connective that is self-dual and non-commutative. Whereas pomset logic originates from the study of coherence spaces and proof nets, BV originates from ...
Lê Thành Dũng Nguyên +1 more
doaj +1 more source
ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost [PDF]
Jisuanji kexue, 2022 The decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction ...
LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
doaj +1 more source
Safe Recursion on Notation into a Light Logic by Levels [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic L4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy.
Luca Roversi, Luca Vercelli
doaj +1 more source
The impact of heterogeneity and geometry on the proof complexity of random satisfiability [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2020 Satisfiability is considered the canonical NP‐complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms can solve large‐scale industrial SAT instances very efficiently.
T. Blasius +4 more
semanticscholar +1 more source
Polylogarithmic Cuts in Models of V^0 [PDF]
Logical Methods in Computer Science, 2013 We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one.
Sebastian Müller
doaj +1 more source
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +1 more source
, 2021 We develop the ontology of “process complexity” and describe how the dynamics of “becoming” can be framed as the emerging, stabilising, and ultimate dissolving of “patterns of relationships.” By extending traditional complexity thinking through ...
Boulton, Jean
core +1 more source