A survey on consensus mechanisms and mining strategy management in blockchain networks
The past decade has witnessed the rapid evolution in blockchain technologies, which has
attracted tremendous interests from both the research communities and industries. The …
attracted tremendous interests from both the research communities and industries. The …
Challenges and opportunities in quantum optimization
Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …
force classical simulation. Interest in quantum algorithms has developed in many areas …
On some fine-grained questions in algorithms and complexity
VV Williams - Proceedings of the international congress of …, 2018 - World Scientific
In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …
based on “fine-grained reductions” that focus on exact running times for problems …
Quantum optimization: Potential, challenges, and the path forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
Proofs of useful work
Abstract We give Proofs of Work (PoWs) whose hardness is based on a wide array of
computational problems, including Orthogonal Vectors, 3SUM, All-Pairs Shortest Path, and …
computational problems, including Orthogonal Vectors, 3SUM, All-Pairs Shortest Path, and …
Outcome indistinguishability
Prediction algorithms assign numbers to individuals that are popularly understood as
individual “probabilities”—what is the probability of 5-year survival after cancer diagnosis …
individual “probabilities”—what is the probability of 5-year survival after cancer diagnosis …
How many qubits are needed for quantum computational supremacy?
Quantum computational supremacy arguments, which describe a way for a quantum
computer to perform a task that cannot also be done by a classical computer, typically …
computer to perform a task that cannot also be done by a classical computer, typically …
Influence of rare earth oxides on microstructure and mechanical properties of nickel-based superalloys fabricated by high energy beam processing: A review
In this paper, the effects of rare earth oxides on the microstructure and mechanical
properties of nickel-based superalloys prepared by high-energy beam processing …
properties of nickel-based superalloys prepared by high-energy beam processing …
Distributed PCP theorems for hardness of approximation in P
We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying
assignment x∈{0, 1} n to a CNF formula φ is shared between two parties, where Alice …
assignment x∈{0, 1} n to a CNF formula φ is shared between two parties, where Alice …
Foundations of homomorphic secret sharing
Homomorphic secret sharing (HSS) is the secret sharing analogue of homomorphic
encryption. An HSS scheme supports a local evaluation of functions on shares of one or …
encryption. An HSS scheme supports a local evaluation of functions on shares of one or …