Efficient enumeration of solutions produced by closure operations
暂无分享,去创建一个
[1] Yann Strozecki,et al. On The Complexity of Enumeration , 2017, ArXiv.
[2] Peter Mayr,et al. The Subpower Membership Problem for Mal'cEV Algebras , 2012, Int. J. Algebra Comput..
[3] Eugene L. Lawler,et al. Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..
[4] Takeaki Uno,et al. Efficient algorithms for dualizing large-scale hypergraphs , 2011, Discret. Appl. Math..
[5] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[6] K. A. Baker,et al. Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems , 1975 .
[7] Vladimir Gurvich,et al. An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension , 2000, Parallel Process. Lett..
[8] Vladimir Gurvich,et al. On the Complexity of Some Enumeration Problems for Matroids , 2005, SIAM J. Discret. Math..
[9] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[10] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[11] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[12] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[13] Khaled M. Elbassioni,et al. Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices , 2017, SWAT.
[14] Marcin Kozik,et al. The subpower membership problem for semigroups , 2016, Int. J. Algebra Comput..
[15] Arnaud Durand,et al. The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete , 2003, STACS.
[16] Georg Gottlob,et al. Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..
[17] Takeaki Uno,et al. Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs , 1997, ISAAC.
[18] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .
[19] Yann Strozecki,et al. Enumeration Complexity of Logical Query Problems with Second-order Variables , 2011, CSL.
[20] Yann Strozecki,et al. Enumeration complexity and matroid decomposition , 2010 .
[21] Markus Steindl. The subpower membership problem for bands , 2016 .
[22] Dániel Marx,et al. Enumerating homomorphisms , 2012, J. Comput. Syst. Sci..
[23] Yann Strozecki. On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation , 2012, Theory of Computing Systems.
[24] John E. Hopcroft,et al. Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[25] P. Hammer,et al. Dual subimplicants of positive Boolean functions , 1998 .
[26] Robert E. Tarjan,et al. Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.
[27] Jeff Shriner. Hardness results for the subpower membership problem , 2018, Int. J. Algebra Comput..
[28] Heribert Vollmer,et al. Optimal satisfiability for propositional calculi and constraint satisfaction problems , 2003, Inf. Comput..
[29] Nadia Creignou,et al. On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..
[30] Henning Schnoor,et al. Enumerating All Solutions for Constraint Satisfaction Problems , 2007, STACS.
[31] Mihalis Yannakakis,et al. On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..
[32] Tomás Feder,et al. Network flow and 2-satisfiability , 1994, Algorithmica.
[33] Martha Sideri,et al. Generating all maximal models of a Boolean expression , 2000, Inf. Process. Lett..