BibTeX record conf/iiaiaai/OkamotoS13

download as .bib file

@inproceedings{DBLP:conf/iiaiaai/OkamotoS13,
  author       = {Yasuhiro Okamoto and
                  Takayoshi Shoudai},
  title        = {Hardness of Learning Unordered Tree Contraction Patterns},
  booktitle    = {2013 Second {IIAI} International Conference on Advanced Applied Informatics,
                  {IIAI-AAI} 2013, Matsue, Japan, August 31 - Sept. 4, 2013},
  pages        = {141--146},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/IIAI-AAI.2013.63},
  doi          = {10.1109/IIAI-AAI.2013.63},
  timestamp    = {Fri, 24 Mar 2023 00:03:58 +0100},
  biburl       = {https://dblp.org/rec/conf/iiaiaai/OkamotoS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.