Entry Khadilkar:1991:PCS from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Khadilkar:1991:PCS,
  author =       "S. N. Khadilkar and S. Biswas",
  title =        "Padding, commitment and self-reducibility",
  journal =      j-THEOR-COMP-SCI,
  volume =       "81",
  number =       "2",
  pages =        "189--199",
  day =          "30",
  month =        apr,
  year =         "1991",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci. and Eng., I.I.T., Kanpur,
                 India",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "co-sparse sets; commitability; commitment;
                 computational complexity; d-self-reducibility; formal
                 languages; kernel constructibility; language; many-one
                 reductions; NP sets; p-selective sets; paddability;
                 padding; polynomial time; search problems; set theory;
                 string; tree search method; trees (mathematics);
                 witness prefix",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries