Search dblp for Publications

• > Home > Search

@article{DBLP:journals/cc/AllenderBDGSS03,
  author       = {Eric Allender and
                  Anna Bernasconi and
                  Carsten Damm and
                  Joachim von zur Gathen and
                  Michael E. Saks and
                  Igor E. Shparlinski},
  title        = {Complexity of some arithmetic problems for binary polynomials},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {1-2},
  pages        = {23--47},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0176-9},
  doi          = {10.1007/S00037-003-0176-9},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AllenderBDGSS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Bley03,
  author       = {Andreas Bley},
  title        = {On the complexity of vertex-disjoint length-restricted path problems},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {3-4},
  pages        = {131--149},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0179-6},
  doi          = {10.1007/S00037-003-0179-6},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/Bley03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Cheng03,
  author       = {Qi Cheng},
  title        = {Straight-line programs and torsion points on elliptic curves},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {3-4},
  pages        = {150--161},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0180-0},
  doi          = {10.1007/S00037-003-0180-0},
  timestamp    = {Tue, 18 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/Cheng03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GutfreundST03,
  author       = {Dan Gutfreund and
                  Ronen Shaltiel and
                  Amnon Ta{-}Shma},
  title        = {Uniform hardness versus randomness tradeoffs for Arthur-Merlin games},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {3-4},
  pages        = {85--130},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0178-7},
  doi          = {10.1007/S00037-003-0178-7},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GutfreundST03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/MiharaS03,
  author       = {Takashi Mihara and
                  Shao Chin Sung},
  title        = {Deterministic polynomial-time quantum algorithms for Simon's problem},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {3-4},
  pages        = {162--175},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0181-z},
  doi          = {10.1007/S00037-003-0181-Z},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/MiharaS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Shaltiel03,
  author       = {Ronen Shaltiel},
  title        = {Towards proving strong direct product theorems},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {1-2},
  pages        = {1--22},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0175-x},
  doi          = {10.1007/S00037-003-0175-X},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Shaltiel03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Watrous03,
  author       = {John Watrous},
  title        = {On the complexity of simulating space-bounded quantum computations},
  journal      = {Comput. Complex.},
  volume       = {12},
  number       = {1-2},
  pages        = {48--84},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00037-003-0177-8},
  doi          = {10.1007/S00037-003-0177-8},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Watrous03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}