Search Results - Algorithms—algebraic algorithms

Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

    Source: Grobner Bases of Acyclic Directed Graphs and Reductions in Conti-Traverso Algorithm (Algebraic Combinatorics on Convex Polytopes). 1175:63-71

  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    File Description: application/pdf

    Relation: reference:[1] Aji, S. M., McEliece, R. J.: The generalized distributive law.IEEE Trans. Inform. Theory 46 (2000), 325-343. Zbl 0998.65146, MR 1748973, 10.1109/18.825794; reference:[2] Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes.J. Assoc. Comput. Mach. 30 (1983), 479-513. Zbl 0624.68087, MR 0709830, 10.1145/2402.322389; reference:[3] Bernstein, P. A., Goodman, N.: The power of natural semijoins.SIAM J. Comput. 10 (1981), 751-771. MR 0635434, 10.1137/0210059; reference:[4] Goldman, S. A., Rivest, R. L.: Making maximum-entropy computations easier by adding extra constraints.In: Maximum-Entropy and Bayesian Methods in Science and Engineering 2 (G. J. Erikson and C. R. Smith, eds.), Kluwer Academic Pub. 1988, pp. 323-340. MR 0970828; reference:[5] Goodman, N., Shmueli, O., Tay, T.: GYO reductions, canonical connections, tree and cyclic schema, and tree projections.J. Comput. and System Sci. 29 (1984), 338-358. MR 0769592, 10.1016/0022-0000(84)90004-7; reference:[6] Kschinschang, F. R., Frey, B. J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm.IEEE Trans. Inform. Theory 47 (2001), 498-519. MR 1820474, 10.1109/18.910572; reference:[7] Maier, D., Ullman, J. D.: Connections in acyclic hypergraphs.Theoret. Comput. Sci. 32 (1984), 185-199. Zbl 0557.05054, MR 0761167, 10.1016/0304-3975(84)90030-6; reference:[8] Malvestuto, F. M.: Existence of extensions and product extensions for discrete probability distributions.Discrete Math. 69 (1988), 61-77. Zbl 0637.60021, MR 0935028, 10.1016/0012-365X(88)90178-1; reference:[9] Malvestuto, F. M.: From conditional independences to factorization constraints with discrete random variables.Ann. Math. Artif. Intel. 35 (2002), 253-285. Zbl 1001.68033, MR 1899954, 10.1023/A:1014551721406; reference:[10] Mezzini, M.: Fast minimal triangulation algorithm using minimum degree criterion.Theoret. Comput. Sci. 412 (2011), 3775-3787. Zbl 1220.05121, MR 2839718, 10.1016/j.tcs.2011.04.022; reference:[11] Tarjan, R. E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs.SIAM J. Comput. 13 (1984), 566-579. Zbl 0562.68055, MR 0749707, 10.1137/0213035

  12. 12
  13. 13
  14. 14
  15. 15

    Source: Journal of Educational Studies in Mathematics and Computer Science. 1:29-40

  16. 16
  17. 17
  18. 18
  19. 19
  20. 20