Results 41 to 50 of about 5,071,272 (326)
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 +5 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
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 +3 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
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
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
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
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
, 2020 A growing number of results in proof complexity rely on so-called "lifting" techniques (also called hardness escalation"), which are inspired from communication complexity.
Vinyals, Marc
core +1 more source