共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
7.
Michael Thomas 《Information Processing Letters》2012,112(10):386-391
For decision problems defined over Boolean circuits using gates from a restricted set B only, we have for all finite sets B and of gates such that all gates from B can be computed by circuits over gates from . In this note, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that and for all finite sets B and of Boolean functions such that all can be defined in . 相似文献
8.
9.
《Journal of Computer and System Sciences》2016,82(5):793-801
10.
11.
12.
13.
《Journal of Computer and System Sciences》2016,82(5):767-781
Let r≥ 4 be an even integer. Graph G is r-bipancyclic if it contains a cycle of every even length from r to , where is the number of vertices in G. A graph G is r-pancyclic if it contains a cycle of every length from r to , where . A graph is k-edge-fault Hamiltonian if, after deleting arbitrary k edges from the graph, the resulting graph remains Hamiltonian. The terms k-edge-fault r-bipancyclic and k-edge-fault r-pancyclic can be defined similarly. Given two graphs G and H, where , 9, let , be the minimum degrees of G and H, respectively. This study determined the edge-fault r-bipancyclic and edge-fault r-pancyclic of Cartesian product graph with some conditions. These results were then used to evaluate the edge-fault pancyclicity (bipancyclicity) of and . 相似文献
14.
《Journal of Computer and System Sciences》2016,82(6):1007-1019
Systems of equations of the form and are considered, in which the unknowns are sets of integers, the plus operator denotes element-wise sum of sets, and C is an ultimately periodic constant. For natural numbers, such equations are equivalent to language equations over a one-symbol alphabet using concatenation and regular constants. It is shown that such systems are computationally universal: for every recursive (r.e., co-r.e.) set there exists a system with a unique (least, greatest) solution containing a component T with . Testing solution existence for these equations is -complete, solution uniqueness is -complete, and finiteness of the set of solutions is -complete. A similar construction for integers represents any hyper-arithmetical set by a set satisfying , whereas testing solution existence is -complete. 相似文献
15.
16.
17.
18.
19.
Let D be an oriented graph with vertices and minimum degree at least , such that, for any two vertices x and y, either x dominates y or . Song (1994) [5] proved that D is pancyclic. Bang-Jensen and Guo (1999) [2] proved, based on Song?s result, that D is vertex pancyclic. In this article, we give a sufficient condition for D to contain a vertex whose out-arcs are pancyclic in D, when . 相似文献
20.