Search dblp for Publications

export results for "toc:db/conf/coco/coco2004.bht:"

 download as .bib file

@inproceedings{DBLP:conf/coco/Aaronson04,
  author       = {Scott Aaronson},
  title        = {Limitations of Quantum Advice and One-Way Communication},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {320--332},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313854},
  doi          = {10.1109/CCC.2004.1313854},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Aaronson04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AmbainisBDR04,
  author       = {Andris Ambainis and
                  Harry Buhrman and
                  Yevgeniy Dodis and
                  Hein R{\"{o}}hrig},
  title        = {Multiparty Quantum Coin Flipping},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {250--259},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313848},
  doi          = {10.1109/CCC.2004.1313848},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AmbainisBDR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/AmbainisY04,
  author       = {Andris Ambainis and
                  Ke Yang},
  title        = {Towards the Classical Communication Complexity of Entanglement Distillation
                  Protocols with Incomplete Information},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {305--319},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313853},
  doi          = {10.1109/CCC.2004.1313853},
  timestamp    = {Fri, 05 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/AmbainisY04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ArvindT04,
  author       = {Vikraman Arvind and
                  Jacobo Tor{\'{a}}n},
  title        = {Solvable Group Isomorphism},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {91--103},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313808},
  doi          = {10.1109/CCC.2004.1313808},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ArvindT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ArvindV04,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  title        = {Abelian Permutation Group Problems and Logspace Counting Classes},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {204--214},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313844},
  doi          = {10.1109/CCC.2004.1313844},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ArvindV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BasuBGL04,
  author       = {Saugata Basu and
                  Nayantara Bhatnagar and
                  Parikshit Gopalan and
                  Richard J. Lipton},
  title        = {Polynomials That Sign Represent Parity and Descartes Rule of Signs},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {223--235},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313846},
  doi          = {10.1109/CCC.2004.1313846},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BasuBGL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BogdanovT04,
  author       = {Andrej Bogdanov and
                  Luca Trevisan},
  title        = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {75--81},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313803},
  doi          = {10.1109/CCC.2004.1313803},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BogdanovT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BuhrmanLM04,
  author       = {Harry Buhrman and
                  Troy Lee and
                  Dieter van Melkebeek},
  title        = {Language Compression and Pseudorandom Generators},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {15--28},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313772},
  doi          = {10.1109/CCC.2004.1313772},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BuhrmanLM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/BuhrmanT04,
  author       = {Harry Buhrman and
                  Leen Torenvliet},
  title        = {Separating Complexity Classes Using Structural Properties},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {130--138},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313820},
  doi          = {10.1109/CCC.2004.1313820},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/BuhrmanT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Buresh-OppenheimM04,
  author       = {Josh Buresh{-}Oppenheim and
                  Tsuyoshi Morioka},
  title        = {Relativized {NP} Search Problems and Propositional Proof Systems},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {54--67},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313795},
  doi          = {10.1109/CCC.2004.1313795},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Buresh-OppenheimM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ChenCFHJKX04,
  author       = {Jianer Chen and
                  Benny Chor and
                  Mike Fellows and
                  Xiuzhen Huang and
                  David W. Juedes and
                  Iyad A. Kanj and
                  Ge Xia},
  title        = {Tight Lower Bounds for Certain Parameterized NP-Hard Problems},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {150--160},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313826},
  doi          = {10.1109/CCC.2004.1313826},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ChenCFHJKX04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/CleveHTW04,
  author       = {Richard Cleve and
                  Peter H{\o}yer and
                  Benjamin Toner and
                  John Watrous},
  title        = {Consequences and Limits of Nonlocal Strategies},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {236--249},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313847},
  doi          = {10.1109/CCC.2004.1313847},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/CleveHTW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GalesiT04,
  author       = {Nicola Galesi and
                  Neil Thapen},
  title        = {The Complexity of Treelike Systems over lamda-Local Formulae},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {68--74},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313798},
  doi          = {10.1109/CCC.2004.1313798},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GalesiT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GlasserPSS04,
  author       = {Christian Gla{\ss}er and
                  Aduri Pavan and
                  Alan L. Selman and
                  Samik Sengupta},
  title        = {Properties of NP-Complete Sets},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {184--197},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313839},
  doi          = {10.1109/CCC.2004.1313839},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GlasserPSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GlasserSS04,
  author       = {Christian Gla{\ss}er and
                  Alan L. Selman and
                  Samik Sengupta},
  title        = {Reductions between Disjoint NP-Pairs},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {42--53},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313791},
  doi          = {10.1109/CCC.2004.1313791},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GlasserSS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/GuruswamiMR04,
  author       = {Venkatesan Guruswami and
                  Daniele Micciancio and
                  Oded Regev},
  title        = {The Complexity of the Covering Radius Problem on Lattices and Codes},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {161--173},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313831},
  doi          = {10.1109/CCC.2004.1313831},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/GuruswamiMR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Hitchcock04,
  author       = {John M. Hitchcock},
  title        = {Small Spans in Scaled Dimension},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {104--112},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313811},
  doi          = {10.1109/CCC.2004.1313811},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Hitchcock04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HitchcockPV04,
  author       = {John M. Hitchcock and
                  Aduri Pavan and
                  N. V. Vinodchandran},
  title        = {Partial Bi-immunity and NP-Completeness},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {198--203},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313842},
  doi          = {10.1109/CCC.2004.1313842},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HitchcockPV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HitchcockV04,
  author       = {John M. Hitchcock and
                  N. V. Vinodchandran},
  title        = {Dimension, Entropy Rates, and Compression},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {174--183},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313835},
  doi          = {10.1109/CCC.2004.1313835},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HitchcockV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Lange04,
  author       = {Klaus{-}J{\"{o}}rn Lange},
  title        = {Some Results on Majority Quantifiers over Words},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {123--129},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313817},
  doi          = {10.1109/CCC.2004.1313817},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Lange04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/LaplanteM04,
  author       = {Sophie Laplante and
                  Fr{\'{e}}d{\'{e}}ric Magniez},
  title        = {Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov
                  Arguments},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {294--304},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313852},
  doi          = {10.1109/CCC.2004.1313852},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LaplanteM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/MarriottW04,
  author       = {Chris Marriott and
                  John Watrous},
  title        = {Quantum Arthur-Merlin Games},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {275--285},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313850},
  doi          = {10.1109/CCC.2004.1313850},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/MarriottW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Marx04,
  author       = {D{\'{a}}niel Marx},
  title        = {Parameterized Complexity of Constraint Satisfaction Problems},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {139--149},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313823},
  doi          = {10.1109/CCC.2004.1313823},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Marx04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Newman04,
  author       = {Ilan Newman},
  title        = {Computing in Fault Tolerance Broadcast Networks},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {113--122},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313813},
  doi          = {10.1109/CCC.2004.1313813},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Newman04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/RazS04,
  author       = {Ran Raz and
                  Amir Shpilka},
  title        = {Deterministic Polynomial Identity Testing in Non-Commutative Models},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {215--222},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313845},
  doi          = {10.1109/CCC.2004.1313845},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/RazS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/RazS04a,
  author       = {Ran Raz and
                  Amir Shpilka},
  title        = {On the Power of Quantum Proofs},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {260--274},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313849},
  doi          = {10.1109/CCC.2004.1313849},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/RazS04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/SelmanS04,
  author       = {Alan L. Selman and
                  Samik Sengupta},
  title        = {Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential
                  Hierarchy},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {82--90},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313805},
  doi          = {10.1109/CCC.2004.1313805},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/SelmanS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/SunYZ04,
  author       = {Xiaoming Sun and
                  Andrew Chi{-}Chih Yao and
                  Shengyu Zhang},
  title        = {Graph Properties and Circular Functions: How Low Can Quantum Query
                  Complexity Go?},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {286--293},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313851},
  doi          = {10.1109/CCC.2004.1313851},
  timestamp    = {Wed, 26 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/SunYZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/TrevisanVZ04,
  author       = {Luca Trevisan and
                  Salil P. Vadhan and
                  David Zuckerman},
  title        = {Compression of Samplable Sources},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {1--14},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313766},
  doi          = {10.1109/CCC.2004.1313766},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/TrevisanVZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Wee04,
  author       = {Hoeteck Wee},
  title        = {On Pseudoentropy versus Compressibility},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {29--41},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313782},
  doi          = {10.1109/CCC.2004.1313782},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Wee04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/coco/2004,
  title        = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://ieeexplore.ieee.org/xpl/conhome/9188/proceeding},
  isbn         = {0-7695-2120-7},
  timestamp    = {Thu, 02 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/2004.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.