FOCS 2002 - PDF Preprint Papers

FOCS 2002 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2002 Paper

click to vote

FOCS
2002
IEEE

171views Theoretical Computer Science» more FOCS 2002»

A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs

14 years 5 months ago

Download www.kenjioba.net

We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....

Andrej Bogdanov, Kenji Obata, Luca Trevisan

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	171	A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs	claim
2	142	Concurrent Zero Knowledge with Logarithmic Round-Complexity	claim
3	139	Protocols and Impossibility Results for Gossip-Based Communication Mechanisms	claim
4	136	A Dichotomy Theorem for Constraints on a Three-Element Set	claim
5	132	Learning Intersections and Thresholds of Halfspaces	claim
6	131	Auctions with Severely Bounded Communication	claim
7	130	Low-Dimensional Linear Programming with Violations	claim
8	129	Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes	claim
9	126	Authentication of Quantum Messages	claim
10	126	Optimal System of Loops on an Orientable Surface	claim
11	123	On the (non)Universality of the One-Time Pad	claim
12	118	A Constant-Factor Approximation Algorithm for the Multicommodity	claim
13	116	The Parameterized Complexity of Counting Problems	claim
14	114	Covering Problems with Hard Capacities	claim
15	113	LT Codes	claim
16	111	The Hardness of 3 - Uniform Hypergraph Coloring	claim
17	110	Decoding Turbo-Like Codes via Linear Programming	claim
18	110	Zero-Knowledge	claim
19	108	The Partition Technique for Overlays of Envelopes	claim
20	108	On Approximating the Radii of Point Sets in High Dimensions	claim
21	106	A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution	claim
22	105	Graph Isomorphism is in SPP	claim
23	99	Testing Juntas	claim
24	99	Minimizing Congestion in General Networks	claim
25	98	Correlation Clustering	claim
26	95	Explicit Unique-Neighbor Expanders	claim
27	94	Market Equilibrium via a Primal-Dual-Type Algorithm	claim
28	94	Implicit B-Trees: New Results for the Dictionary Problem	claim
29	93	An Information Statistics Approach to Data Stream and Communication Complexity	claim
30	90	Dependent Rounding in Bipartite Graphs	claim
31	88	Quantum Computation and Lattice Problems	claim
32	84	Power from Random Strings	claim
33	83	Global Information from Local Observation	claim
34	82	Small Induced-Universal Graphs and Compact Implicit Graph Representations	claim
35	82	Dynamic Planar Convex Hull	claim
36	81	Learning a Hidden Matching	claim
37	79	Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows	claim
38	79	On-Line End-to-End Congestion Control	claim
39	78	Load Balancing with Memory	claim
40	78	An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree	claim
41	76	On Random Symmetric Travelling Salesman Problems	claim
42	73	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers