T. Batu, R. Rubinfeld and P. White, Fast approximation PCPs for multidimensional bin-packing problems, International Workshop on Randomization and Approximation Techniques in Computer Science (1999), 246--256. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The art of uninformed decisions: A primer to property testing - Fischer (2001) (10 citations) (Correct)
....and the case that the input is far from satisfying the property. In general the prover is allowed to supply a long proof, but the veri er is still allowed only a small number of queries from the input as well as from the supplied proof. Testing with a prover is investigated in [18] and [9]; in these the running time of the veri er is restricted as well, and this poses some restrictions on the size of the proof through the size of the allowable address space. As expected, there are problems that are hard to test in the usual context but are easy to test with a prover. For example, ....
T. Batu, R. Rubinfeld and P. White, Fast approximation PCPs for multidimensional binpacking problems, Proceedings of the 3 International Workshop on Randomization and Approximation Techniques in Computer Science (1999), 246-256.
On the Strength of Comparisons in Property Testing - Fischer (4 citations) (Correct)
....es P and the case that it is far from satisfying P . We make no assumption on the computational complexity of deciding which queries the algorithm makes. The object of investigation here is the minimum number of queries that an test needs to make; for example, it is proven in [7] see also [3] for related applications) that the property of being a NEC Research Institute, 4 Independence Way, Princeton NJ 08540, USA; and DIMACS. Email address: scher research.nj.nec.com 1 monotone nondecreasing sequence requires no more than O(log d) queries for any xed ; it was also proven there ....
....and Sudan [11] who were motivated mainly by its connection to the study of program checking. In [8] the notion of testability in the context of graphs was introduced, and investigated further in [1] In [2] the notion of testability in the context of regular languages was investigated. In [7] [3] and [6] properties de ned in terms of monotonicity and order relations were investigated. In the following we concern ourselves with properties of sequences of positive integers, de ned only in terms of the order relations between the values of their members. More formally, we say that a ....
[Article contains additional citation context not shown here]
T. Batu, R. Rubinfeld and P. White, Fast approximation PCPs for multidimensional binpacking problems, Proceedings of the third international workshop on randomization and approximation techniques in computer science (D. Hochbaum, K. Jansen, J. P. D. Rolim and A. Sinclair eds), pp. 245-256, Springer-Verlag, Berkeley CA (1999).
Monotonicity Testing over General Poset Domains.. - Fischer, Lehman.. (2002) (3 citations) (Correct)
No context found.
T. Batu, R. Rubinfeld and P. White, Fast approximation PCPs for multidimensional bin-packing problems, International Workshop on Randomization and Approximation Techniques in Computer Science (1999), 246--256.
Property Testing: Theory and Applications - Raskhodnikova (2003) (Correct)
No context found.
Tugkan Batu, Ronitt Rubinfeld and Patrick White. Fast approximation PCPs for multidimensional bin-packing problems. In Proceedings of the 3 International Workshop on Randomization and Approximation Techniques in Computer Science, 246--256, 1999.
Distribution-Free Property Testing - Halevy, Kushilevitz (Correct)
No context found.
T. Batu, R. Rubinfeld, and P. White, Fast approximation PCPs for multidimensional bin-packing problems, Proceedings of the 3 International Workshop on Randomization and Approximation Techniques in Computer Science 246--256,1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC