نتایج جستجو برای: complete bipartiate
تعداد نتایج: 360248 فیلتر نتایج به سال:
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that singleplayer dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players c...
We consider several natural fragments of the alternating-time temporal logics ATL* and ATL with restrictions on the nesting between temporal operators and strategic quantifiers. We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In particular, we prove that the satisfiability problem for state for...
We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.
The measurement of the J=1–0 line of CO with the IRAM interferometer is reported. The CO line parameters are in good agreement with the result given by Scoville et al. (1993). Thus, CO emission from 3C 48, a radio loud QSO, is definitely detected. The CO emission region is marginally resolved. Source parameters based on the CO line data are discussed.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید