منابع مشابه
Query complexity of mastermind variants
We study variants of Mastermind, a popular board game in which the objective is sequence reconstruction. In this two-player game, the so-called codemaker constructs a hidden sequence H = (h1, h2, . . . , hn) of colors selected from an alphabet A = {1, 2, . . . , k} (i.e., hi ∈ A for all i ∈ {1, 2, . . . , n}). The game then proceeds in turns, each of which consists of two parts: in turn t, the ...
متن کاملOn the Query Complexity of Black-Peg AB-Mastermind
Mastermind game is a two players zero sum game of imperfect information. The first player, called “codemaker”, chooses a secret code and the second player, called “codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the codemaker after each guess. In this paper, we consider the so called Black-Peg variant of Mastermind, wher...
متن کاملQuery Complexity of Matroids
Let M be a bridgeless matroid on ground set {1, . . . , n} and fM : {0, 1} → {0, 1} be the indicator function of its independent sets. A folklore fact is that fM is evasive, i.e., D(fM) = n where D(f) denotes the deterministic decision tree complexity of f. Here we prove query complexity lower bounds for fM in three stronger query models: (a) D⊕(fM) = Ω(n), where D⊕(f) denotes the parity decisi...
متن کاملThe Complexity of Query
The reliability of database queries on databases with uncertain information is studied, on the basis of a probabilistic model for unreliable databases. While it was already known that the reliability of quantiier-free queries is computable in polynomial time, we show here that already for conjunctive queries, the reliability may become highly intractable. We exhibit a conjunctive query whose re...
متن کامل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 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.11.004