Entry Lincoln:1998:CLP 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{Lincoln:1998:CLP,
  author =       "P. D. Lincoln and J. C. Mitchell and A. Scedrov",
  title =        "The complexity of local proof search in linear logic",
  journal =      j-THEOR-COMP-SCI,
  volume =       "197",
  number =       "1--2",
  pages =        "245--??",
  day =          "15",
  month =        may,
  year =         "1998",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Wed May 27 07:21:35 MDT 1998",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  acknowledgement = ack-nhfb,
  classification = "C1140E (Game theory); C1180 (Optimisation
                 techniques); C4210 (Formal logic); C4240C
                 (Computational complexity)",
  conflocation = "Tokyo, Japan; 28 March-2 April 1996",
  conftitle =    "Linear Logic '96 (papers in summary form only
                 received)",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational complexity; formal logic; game theory;
                 linear logic; linear logic proof games; local proof
                 search complexity; lower bounds; MALL; MLL;
                 multiplicative-additive fragment; NP-complete;
                 optimisation; partial proof tree; proof search
                 heuristics; propositional linear logic formulas;
                 PSACE-complete; randomization",
  pubcountry =   "Netherlands",
  treatment =    "G General Review",
  xxnote =       "Check page numbers: duplicate in adjacent entries",
}

Related entries