ECCC 2008 - PDF Preprint Papers

ECCC 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ECCC-2008 Paper

click to vote

ECCC
2008

186views more ECCC 2008»

Universal Semantic Communication II: A Theory of Goal-Oriented Communication

13 years 4 months ago

Download people.csail.mit.edu

We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...

Brendan Juba, Madhu Sudan

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	186	Universal Semantic Communication II: A Theory of Goal-Oriented Communication	claim
2	168	Algebrization: A New Barrier in Complexity Theory	claim
3	122	Every Minor-Closed Property of Sparse Graphs is Testable	claim
4	117	The complexity of learning SUBSEQ(A)	claim
5	116	On the complexity of cutting plane proofs using split cuts	claim
6	108	The Complexity of Rationalizing Matchings	claim
7	107	A Quantum Time-Space Lower Bound for the Counting Hierarchy	claim
8	104	Property Testing of Equivalence under a Permutation Group Action	claim
9	102	Elusive Functions and Lower Bounds for Arithmetic Circuits	claim
10	99	Parallel Repetition in Projection Games and a Concentration Bound	claim
11	98	Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem	claim
12	98	Closed Timelike Curves Make Quantum and Classical Computing Equivalent	claim
13	93	A Note on the Distance to Monotonicity of Boolean Functions	claim
14	91	On the Efficiency of Non-Uniform PCPP Verifiers	claim
15	90	Some Topics in Analysis of Boolean Functions	claim
16	89	Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas	claim
17	82	On Perfect Completeness for QMA	claim
18	80	Decodability of Group Homomorphisms beyond the Johnson Bound	claim
19	80	A simple proof of Bazzi's theorem	claim
20	79	Valiant-Vazirani Lemmata for Various Logics	claim
21	74	The Sign-Rank of AC^0	claim
22	71	Finding Significant Fourier Transform Coefficients Deterministically and Locally	claim
23	65	A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths	claim
24	63	On the OBDD complexity of the most significant bit of integer multiplication	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers