A Complexity Theory Based on Boolean Algebra.

Sven Skyum, Leslie G. Valiant: A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502(1985)

@article{DBLP:journals/jacm/SkyumV85,
  author    = {Sven Skyum and
               Leslie G. Valiant},
  title     = {A Complexity Theory Based on Boolean Algebra},
  journal   = {J. ACM},
  volume    = {32},
  number    = {2},
  year      = {1985},
  pages     = {484-502},
  ee        = {db/journals/jacm/SkyumV85.html, http://doi.acm.org/10.1145/3149.3158},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Georg Gottlob, Nicola Leone, Francesco Scarcello: Hypertree Decompositions and Tractable Queries. PODS 1999: 21-32
Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. PODS 1991: 13-25

BibTeX