Abstract combinatorial programs and efficient property testers - Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on
نویسندگان
چکیده
Combinatorial Programs and Efficient Property Testers Artur Czumaj Department of Computer Science New Jersey Institute of Technology University Heights Newark, NJ 07102-1982, USA E-mail: [email protected] Christian Sohler Heinz Nixdorf Institute and Department of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany E-mail: [email protected]
منابع مشابه
Testing Membership in Languages that Have Small Width Branching Programs
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [J. ACM, 45 (1998), pp. 653–750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252–271], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is “far” from having the property. The main result...
متن کاملCombinatorial Programs and Efficient Property Testers ∗
Combinatorial Programs and Efficient Property Testers ∗ Artur Czumaj Department of Computer Science New Jersey Institute of Technology University Heights Newark, NJ 07102-1982, USA E-mail: [email protected] Christian Sohler Heinz Nixdorf Institute and Department of Mathematics & Computer Science University of Paderborn D-33095 Paderborn, Germany E-mail: [email protected]
متن کاملAbstract Combinatorial Programs and Efficient Property Testers
COMBINATORIAL PROGRAMS AND EFFICIENT PROPERTY TESTERS∗ ARTUR CZUMAJ† AND CHRISTIAN SOHLER‡ Abstract. Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our ...
متن کاملImproved Lower Bounds for Embeddings into L
We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an n-point metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bound on the integrality gap of a well-known semidefinite programming relaxation for sparsest cut. ...
متن کاملFast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
We study combinatorial optimization problems in which a set of distributed agents must achieve a global objective using only local information. Papadimitriou and Yannakakis [Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 121–129] initiated the study of such problems in a framework where distributed decision-makers must generate feasible solutions to positive linear prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001