Results 31 to 40 of about 1,041,680 (279)
Tuples of disjoint NP-sets [PDF]
, 2008 Disjoint NPUnknown control sequence '\mathsf' -pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof complexity.
Beyersdorff, O
core +2 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
, 2016 Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class \class{NP}, known as QMA, in which a ...
Vidick, Thomas, Watrous, John
core +2 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
Different Approaches to Proof Systems [PDF]
, 2010 The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies. This approach has been intensively studied since the late 70’s
Beyersdorff, O, Mueller, S
core +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
Exponential Separation of Quantum Communication and Classical Information [PDF]
, 2016 We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis et. al.
Laurière Mathieu +4 more
core +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