کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
470235 698421 2008 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The consequences of eliminating NP solutions
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
The consequences of eliminating NP solutions
چکیده انگلیسی

Given a function based on the computation of an NP machine, can one in general eliminate some solutions? That is, can one in general decrease the ambiguity? This simple question remains, even after extensive study by many researchers over many years, mostly unanswered. However, complexity-theoretic consequences and enabling conditions are known. In this tutorial-style article we look at some of those, focusing on the most natural framings: reducing the number of solutions of NP functions, refining the solutions of NP functions, and subtracting from or otherwise shrinking #P functions. We will see how small advice strings are important here, but we also will see how increasing advice size to achieve robustness is central to the proof of a key ambiguity-reduction result for NP functions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Science Review - Volume 2, Issue 1, April 2008, Pages 40–54
نویسندگان
, ,