Entry Czumaj:1996:GPN 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{Czumaj:1996:GPN,
  author =       "Artur Czumaj and Alan Gibbons",
  title =        "{Guthrie}'s problem: new equivalences and rapid
                 reductions",
  journal =      j-THEOR-COMP-SCI,
  volume =       "154",
  number =       "1",
  pages =        "3--22",
  day =          "22",
  month =        jan,
  year =         "1996",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:40 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=154&issue=1;
                 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=1996&volume=154&issue=1&aid=2067",
  acknowledgement = ack-nhfb,
  classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
                 C4210L (Formal languages and computational
                 linguistics); C4240C (Computational complexity)",
  conflocation = "Lund, Sweden; 5-9 July 1993",
  conftitle =    "ICALP 93. 20th International Colloquium on Automata,
                 Languages and Programming",
  corpsource =   "Inst. of Inf., Warsaw Univ., Poland",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "3-edge colouring; algebra; algebraic expression
                 intersections; computational complexity; equations;
                 equivalences; exponential-time complexity; formal
                 languages; four-colour theorem; four-colouring
                 algorithms; four-vertex colourable graphs; graph
                 colouring; Guthrie's conjecture; implicit algorithm;
                 integer linear equation intersections; optimally fast
                 reduction; planar graph; polynomial time complexity;
                 rapid reductions; regular language intersections;
                 theorem proving; tree pairs; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries