Search dblp for Publications

export results for "toc:db/journals/dam/dam149.bht:"

 download as .bib file

@article{DBLP:journals/dam/Bioch05,
  author       = {Jan C. Bioch},
  title        = {The complexity of modular decomposition of Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {1--13},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2003.12.010},
  doi          = {10.1016/J.DAM.2003.12.010},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Bioch05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CepekK05,
  author       = {Ondrej Cepek and
                  Petr Kucera},
  title        = {Known and new classes of generalized Horn formulae with polynomial
                  recognition and {SAT} testing},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {14--52},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2003.12.011},
  doi          = {10.1016/J.DAM.2003.12.011},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CepekK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CohenCJK05,
  author       = {David A. Cohen and
                  Martin C. Cooper and
                  Peter Jeavons and
                  Andrei A. Krokhin},
  title        = {Supermodular functions and the complexity of {MAX} {CSP}},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {53--72},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2005.03.003},
  doi          = {10.1016/J.DAM.2005.03.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CohenCJK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/CusickL05,
  author       = {Thomas W. Cusick and
                  Yuan Li},
  title        = {\emph{k}-th order symmetric {SAC} boolean functions and bisecting
                  binomial coefficients},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {73--86},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2005.02.006},
  doi          = {10.1016/J.DAM.2005.02.006},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/CusickL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/FayeT05,
  author       = {Alain Faye and
                  Quoc{-}an Trinh},
  title        = {A polyhedral approach for a constrained quadratic 0-1 problem},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {87--100},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.02.020},
  doi          = {10.1016/J.DAM.2004.02.020},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/FayeT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/HatamiM05,
  author       = {Hamed Hatami and
                  Hossein Maserrat},
  title        = {On the computational complexity of defining sets},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {101--110},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2005.03.004},
  doi          = {10.1016/J.DAM.2005.03.004},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/HatamiM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/JansenW05,
  author       = {Thomas Jansen and
                  Ingo Wegener},
  title        = {Real royal road functions--where crossover provably is essential},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {111--125},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.02.019},
  doi          = {10.1016/J.DAM.2004.02.019},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/JansenW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Kucera05,
  author       = {Petr Kucera},
  title        = {On the size of maximum renamable Horn sub-CNF},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {126--130},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.05.007},
  doi          = {10.1016/J.DAM.2004.05.007},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Kucera05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/MintzG05,
  author       = {Aviad Mintz and
                  Martin Charles Golumbic},
  title        = {Factoring Boolean functions using graph partitioning},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {131--153},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2005.02.007},
  doi          = {10.1016/J.DAM.2005.02.007},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MintzG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/SchieberGZ05,
  author       = {Baruch Schieber and
                  Daniel Geist and
                  Ayal Zaks},
  title        = {Computing the minimum {DNF} representation of Boolean functions defined
                  by intervals},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {154--173},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.08.009},
  doi          = {10.1016/J.DAM.2004.08.009},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/SchieberGZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Wild05,
  author       = {Marcel Wild},
  title        = {The many benefits of putting stack filters into disjunctive or conjunctive
                  normal form},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {174--191},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.06.027},
  doi          = {10.1016/J.DAM.2004.06.027},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Wild05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Xiao05,
  author       = {Wenjun Xiao},
  title        = {Linear symmetries of Boolean functions},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {192--199},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2005.02.008},
  doi          = {10.1016/J.DAM.2005.02.008},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Xiao05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/Zverovich05,
  author       = {Igor E. Zverovich},
  title        = {Characterizations of closed classes of Boolean functions in terms
                  of forbidden subfunctions and Post classes},
  journal      = {Discret. Appl. Math.},
  volume       = {149},
  number       = {1-3},
  pages        = {200--218},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.dam.2004.06.028},
  doi          = {10.1016/J.DAM.2004.06.028},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Zverovich05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.