Discrete Mathematics and Theoretical Computer Science
暂无分享,去创建一个
[1] H. H. Schaefer. Banach Lattices and Positive Operators , 1975 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Julian Scott Yeomans,et al. A linear time algorithm for maximum matchings in convex, bipartite graphs☆ , 1996 .
[4] Laurent Viennot,et al. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..
[5] Moshé MacHover. VARIETIES OF CONSTRUCTIVE MATHEMATICS (London Mathematical Society Lecture Note Series 97) , 1988 .
[6] D. Hugh Redelmeier,et al. Counting polyominoes: Yet another attack , 1981, Discret. Math..
[7] Renzo Pinzani,et al. An algebraic characterization of the set of succession rules , 2002, Theor. Comput. Sci..
[8] J. L. Bell. CONSTRUCTIVE ANALYSIS (Grundlehren der mathematischen Wissenschaften, 279) , 1986 .
[9] Stephen A. Cook,et al. Time-bounded random access machines , 1972, J. Comput. Syst. Sci..
[10] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[11] S. W. Golomb,et al. Checker Boards and Polyominoes , 1954 .
[12] Giorgio Gallo. An O(n log n) algorithm for the convex bipartite matching problem , 1984 .
[13] Martin Loebl,et al. Generating convex polyominoes at random , 1996, Discret. Math..