Search dblp for Publications

• > Home > Search

@article{DBLP:journals/cc/Ben-Sasson02,
  author       = {Eli Ben{-}Sasson},
  title        = {Hard examples for the bounded depth Frege proof system},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {3-4},
  pages        = {109--136},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-002-0172-5},
  doi          = {10.1007/S00037-002-0172-5},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/Ben-Sasson02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/Buresh-OppenheimCIP02,
  author       = {Josh Buresh{-}Oppenheim and
                  Matthew Clegg and
                  Russell Impagliazzo and
                  Toniann Pitassi},
  title        = {Homogenization and the polynomial calculus},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {3-4},
  pages        = {91--108},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-002-0171-6},
  doi          = {10.1007/S00037-002-0171-6},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/Buresh-OppenheimCIP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/CodenottiSW02,
  author       = {Bruno Codenotti and
                  Igor E. Shparlinski and
                  Arne Winterhof},
  title        = {On the hardness of approximating the permanent of structured matrices},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {3-4},
  pages        = {158--170},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-002-0174-3},
  doi          = {10.1007/S00037-002-0174-3},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/CodenottiSW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/DammHM02,
  author       = {Carsten Damm and
                  Markus Holzer and
                  Pierre McKenzie},
  title        = {The complexity of tensor calculus},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {1-2},
  pages        = {54--89},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-000-0170-4},
  doi          = {10.1007/S00037-000-0170-4},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/DammHM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/FortnowR02,
  author       = {Lance Fortnow and
                  John D. Rogers},
  title        = {Separability and one-way functions},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {3-4},
  pages        = {137--157},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-002-0173-4},
  doi          = {10.1007/S00037-002-0173-4},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/FortnowR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/GoldreichVW02,
  author       = {Oded Goldreich and
                  Salil P. Vadhan and
                  Avi Wigderson},
  title        = {On interactive proofs with a laconic prover},
  journal      = {Comput. Complex.},
  volume       = {11},
  number       = {1-2},
  pages        = {1--53},
  year         = {2002},
  url          = {https://doi.org/10.1007/s00037-002-0169-0},
  doi          = {10.1007/S00037-002-0169-0},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/GoldreichVW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}