Journal Article10.1137/130927115
New Limits to Classical and Quantum Instance Compression
179
TL;DR: Given an instance of a hard decision problem, a limited goal is to compress that instance into a smaller, equivalent instances of a second problem.
read more
Abstract: Given an instance of a hard decision problem, a limited goal is to compress that instance into a smaller, equivalent instance of a second problem. As one example, consider the problem where, given ...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Structural diversity and chemical trends in hybrid inorganic–organic framework materials
TL;DR: The diversity of this complex class of materials is examined, a simple but systematic classification is proposed, and the growing evidence that many hybrid frameworks tend to form under thermodynamic rather than kinetic control when the synthesis is carried out under hydrothermal conditions is discussed.
1.5K
•Book
Kernelization: Theory of Parameterized Preprocessing
Fedor V. Fomin,Daniel Lokshtanov,Saket Saurabh,Meirav Zehavi +3 more
- 28 Feb 2019
TL;DR: Kernelization: Theory of Parameterized Preprocessing, by Fomin et al., is unique in that it is a text focusing solely on the titular topic of kernelization, and is able to more effectively showcase and teach the tools used in the field than a more traditional text on fixed parameter complexity.
253
•Posted Content
Kernelization Lower Bounds By Cross-Composition
TL;DR: In this paper, the authors introduce the cross-composition framework for proving kernelization lower bounds, which generalizes and strengthens the recent techniques of using composition algorithms and of transferring the lower bounds via polynomial parameter transformations.
Constant-round interactive proofs for delegating computation
Omer Reingold,Guy N. Rothblum,Ron D. Rothblum +2 more
- 19 Jun 2016
TL;DR: The main result is that for every statement that can be evaluated in polynomial time and bounded-polynomial space there exists an interactive proof that satisfies the following strict efficiency requirements: the honest prover runs in polynnomial time, the verifier is almost linear time, and the interaction consists of only a constant number of communication rounds.
218
References
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Computational Complexity: A Modern Approach
Sanjeev Arora,Boaz Barak +1 more
- 20 Apr 2009
TL;DR: This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.
Improved decoding of Reed-Solomon and algebraic-geometry codes
Venkatesan Guruswami,Madhu Sudan +1 more
TL;DR: An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.
1.1K
A Parallel Repetition Theorem
TL;DR: It is shown that a parallel repetition of any two-prover one-round proof system (MIP(2,1) decreases the probability of error at an exponential rate, and no constructive bound was previously known.
935
Complexity measures and decision tree complexity: a survey
Harry Buhrman,Ronald de Wolf +1 more
TL;DR: Several complexity measures for Boolean functions are discussed: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial, and how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.
929