Fast approximate PCPs for multidimensional bin-packing problems
暂无分享,去创建一个
[1] Eyal Kushilevitz,et al. Distribution-Free Property Testing , 2003, RANDOM-APPROX.
[2] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[3] Dana Ron,et al. Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..
[4] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[5] Ronitt Rubinfeld,et al. Spot-checkers , 1998, STOC '98.
[6] Dana Ron,et al. Testing Monotonicity , 2000, Comb..
[7] Ronitt Rubinfeld,et al. Spot-Checkers , 2000, J. Comput. Syst. Sci..
[8] Ronitt Rubinfeld,et al. Monotonicity testing over general poset domains , 2002, STOC '02.
[9] Ronitt Rubinfeld,et al. Fast approximate probabilistically checkable proofs , 2004, Inf. Comput..
[10] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.