Entry Creignou:1995:CPL from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Creignou:1995:CPL,
  author =       "Nadia Creignou",
  title =        "The class of problems that are linearly equivalent to
                 {Satisfiability} or a uniform method for proving
                 {NP}-completeness",
  journal =      j-THEOR-COMP-SCI,
  volume =       "145",
  number =       "1--2",
  pages =        "111--145",
  day =          "10",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:12 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=145&issue=1-2&aid=1816",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240C (Computational complexity)",
  corpsource =   "Dept. de Math., Caen Univ., France",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-Colorability; 3-Dimensional Matching; 3-Exact Cover;
                 computability; computational complexity; computational
                 model; Cubic Subgraph; decidability; Kernel of Graph;
                 linear-time equivalent; linear-time transformations;
                 linearly equivalent; natural combinatorial problems;
                 NP- completeness; Partition into Hamiltonian Subgraphs;
                 Partition into Paths; Partition into Triangles; Path
                 with Forbidden Pairs; Path without Chord; Restricted
                 Perfect Matching; SAT-equivalent; satisfiability;
                 sorting; sortings; Turing machine; uniform method",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries