منابع مشابه
Parameterized Complexity of Secure Sets
Secure sets were introduced by Brigham, Dutton, and Hedetniemi [1] as an extension of defensive alliances in a graph. Members of a defensive alliance have agreed to come to the aid of their neighbors in the alliance for mutual protection from attack by nonmembers. Alliances can occur, for example, between nations, biological sequences, and business cartels, and also have been used to model a va...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولComplexity-Class-Encoding Sets
Properties of sets which are complex because they encode complexity classes are explored. It is shown that not all sets with inherent complexity are of this type, although this is the only type of set for which well-developed techniques exist for proving inherent complexity. Possibilities for the complexity of encoding sets are discussed, first with reference to an "almost everywhere" vs. "infi...
متن کاملSecure Sketch for Multi-Sets
Given the original set X where |X| = s, a sketch P is computed from X and made public. From another set Y where |Y | = s and P , we can reconstruct X if |X ∩ Y | ≥ |s − t|, where t < s is some threshold. The sketch P is secure if it does not reveal much information about X. A few constructions have been proposed, but they cannot handle multi-sets, that is, sets that may contain duplicate elemen...
متن کاملSets versus Complexity
The study of sparse hard sets and sparse complete sets has been a central research area in complexity theory for nearly two decades. Recently new results using unexpected techniques have been obtained. They provide new and easier proofs of old theorems, proofs of new theorems that unify previously known results, resolutions of old conjectures, and connections to the fascinating world of randomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0358-5