Results 31 to 40 of about 156,901 (262)
Proof Complexity Meets Algebra [PDF]
ACM Transactions on Computational Logic, 2018 We analyze how the standard reductions between constraint satisfaction problems affect their proof complexity. We show that, for the most studied propositional, algebraic, and semialgebraic proof systems, the classical constructions of pp-interpretability, homomorphic equivalence, and addition of constants to a core preserve the proof complexity of the
Atserias, Albert, Ochremiak, Joanna
openaire +6 more sources
A Survey of Noninteractive Zero Knowledge Proof System and Its Applications
The Scientific World Journal, 2014 Zero knowledge proof system which has received extensive attention since it was proposed is an important branch of cryptography and computational complexity theory.
Huixin Wu, Feng Wang
doaj +1 more source
Linguistic Complexity and Argumentative Unity: A Lvov-Warsaw School Supplement
Studies in Logic, Grammar and Rhetoric, 2014 It is argued that the source of complexity in language is twofold: repetition, and syntactic embedding. The former enables us to return again and again to the same subject across many sentences, and to maintain the coherence of an argument. The latter is
Simons Peter
doaj +1 more source
Proof equivalence in MLL is PSPACE-complete [PDF]
Logical Methods in Computer Science, 2016 MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-autonomous categories. Previous work has shown the problem
Willem Heijltjes, Robin Houston
doaj +1 more source
General bounds on holographic complexity
Journal of High Energy Physics, 2022 We prove a positive volume theorem for asymptotically AdS spacetimes: the maximal volume slice has nonnegative vacuum-subtracted volume, and the vacuum-subtracted volume vanishes if and only if the spacetime is identically pure AdS.
Netta Engelhardt, Åsmund Folkestad
doaj +1 more source
Measurement: Sensors, 2021 Aiming at railway products with high complexity of parameter features, a method for identifying key influencing factors of railway product testing based on random forest (RF) and sequential forward selection (SFS) algorithm is proposed to assist the ...
Xiulin Hou +3 more
doaj +1 more source
On the complexity of proof deskolemization
The Journal of Symbolic Logic, 2012 AbstractWe consider the following problem: Given a proof of the Skolemization of a formulaF, what is the length of the shortest proof ofF? For the restriction of this question to cut-free proofs we prove corresponding exponential upper and lower bounds.
Matthias Baaz +2 more
openaire +2 more sources
Proof complexity of substructural logics
Annals of Pure and Applied Logic, 2021 34 ...
openaire +3 more sources
Proof of a momentum/complexity correspondence [PDF]
Physical Review D, 2020 10 pages, 2 figures.
J. L. F. Barbón +2 more
openaire +4 more sources
Pedagogical implications of students’ misconceptions about deductive geometric proof
Acta Academica, 2012 The role of proof in school geometry has been a subject of intense debate throughout the twentieth century and that debate persists even today. This study aims to identify and analyse deductive geometric proof difficulties encountered by Bachelor of ...
Mdutshekelwa Ndlovu, Andile Mji
doaj +3 more sources