Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/eccc/eccc9.bht:"
download as .bib file
@article{DBLP:journals/eccc/ECCC-TR02-001,
author = {Cynthia Dwork and
Moni Naor},
title = {Zaps and Their Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-001}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-001/index.html},
eprinttype = {ECCC},
eprint = {TR02-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-002,
author = {Howard Barnum and
Michael E. Saks},
title = {A lower bound on the quantum query complexity of read-once functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-002}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-002/index.html},
eprinttype = {ECCC},
eprint = {TR02-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-003,
author = {Eli Ben{-}Sasson and
Yonatan Bilu},
title = {A Gap in Average Proof Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-003}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-003/index.html},
eprinttype = {ECCC},
eprint = {TR02-003},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-004,
author = {Till Tantau},
title = {A Note on the Power of Extra Queries to Membership Comparable Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-004}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-004/index.html},
eprinttype = {ECCC},
eprint = {TR02-004},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-005,
author = {Aduri Pavan and
Alan L. Selman},
title = {Bi-Immunity Separates Strong NP-Completeness Notions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-005}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-005/index.html},
eprinttype = {ECCC},
eprint = {TR02-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-006,
author = {Philippe Moser},
title = {Random nondeterministic real functions and Arthur Merlin games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-006}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-006/index.html},
eprinttype = {ECCC},
eprint = {TR02-006},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-007,
author = {Pavel Pudl{\'{a}}k},
title = {Monotone complexity and the rank of matrices},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-007}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-007/index.html},
eprinttype = {ECCC},
eprint = {TR02-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-008,
author = {Valentine Kabanets},
title = {Derandomization: {A} Brief Overview},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-008}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-008/index.html},
eprinttype = {ECCC},
eprint = {TR02-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-009,
author = {Petr Savick{\'{y}}},
title = {On determinism versus unambiquous nondeterminism for decision trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-009}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-009/index.html},
eprinttype = {ECCC},
eprint = {TR02-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-010,
author = {Albert Atserias and
Maria Luisa Bonet},
title = {On the Automatizability of Resolution and Related Propositional Proof
Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-010}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-010/index.html},
eprinttype = {ECCC},
eprint = {TR02-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-011,
author = {Boris Ryabko},
title = {The nonprobabilistic approach to learning the best prediction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-011}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-011/index.html},
eprinttype = {ECCC},
eprint = {TR02-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-012,
author = {Ran Raz},
title = {On the Complexity of Matrix Product},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-012}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-012/index.html},
eprinttype = {ECCC},
eprint = {TR02-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-013,
author = {Chris Pollett and
Farid M. Ablayev and
Cristopher Moore},
title = {Quantum and Stochastic Programs of Bounded Width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-013}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-013/index.html},
eprinttype = {ECCC},
eprint = {TR02-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-014,
author = {Klaus Weihrauch},
title = {Computational Complexity on Computable Metric Spaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-014}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-014/index.html},
eprinttype = {ECCC},
eprint = {TR02-014},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-015,
author = {Philippe Moser},
title = {{ZPP} is hard unless {RP} is small},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-015}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-015/index.html},
eprinttype = {ECCC},
eprint = {TR02-015},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-016,
author = {Alina Beygelzimer and
Mitsunori Ogihara},
title = {On the Enumerability of the Determinant and the Rank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-016}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-016/index.html},
eprinttype = {ECCC},
eprint = {TR02-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-017,
author = {Aggelos Kiayias and
Moti Yung},
title = {Cryptographic Hardness based on the Decoding of Reed-Solomon Codes
with Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-017}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-017/index.html},
eprinttype = {ECCC},
eprint = {TR02-017},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-018,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Approximating Huffman Codes in Parallel},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-018}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-018/index.html},
eprinttype = {ECCC},
eprint = {TR02-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-019,
author = {Nader H. Bshouty and
Lynn Burroughs},
title = {On the proper learning of axis parallel concepts},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-019}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-019/index.html},
eprinttype = {ECCC},
eprint = {TR02-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-020,
author = {Elizaveta A. Okol'nishnikova},
title = {On one lower bound for branching programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-020}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-020/index.html},
eprinttype = {ECCC},
eprint = {TR02-020},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-021,
author = {Andreas Jakoby and
Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Space Efficient Algorithms for Directed Series-Parallel Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-021}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-021/index.html},
eprinttype = {ECCC},
eprint = {TR02-021},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-022,
author = {Wolfgang Maass and
Henry Markram},
title = {On the Computational Power of Recurrent Circuits of Spiking Neurons},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-022}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-022/index.html},
eprinttype = {ECCC},
eprint = {TR02-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-023,
author = {Josh Buresh{-}Oppenheim and
Paul Beame and
Toniann Pitassi and
Ran Raz and
Ashish Sabharwal},
title = {Bounded-depth Frege lower bounds for weaker pigeonhole principles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-023}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-023/index.html},
eprinttype = {ECCC},
eprint = {TR02-023},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-024,
author = {Piotr Indyk},
title = {List-decoding in Linear Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-024}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-024/index.html},
eprinttype = {ECCC},
eprint = {TR02-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-025,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon and
Yuval Rabani},
title = {Polynomial Time Approximation Schemes for Metric Min-Sum Clustering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-025}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-025/index.html},
eprinttype = {ECCC},
eprint = {TR02-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-026,
author = {Boaz Barak and
Yehuda Lindell},
title = {Strict Polynomial-time in Simulation and Extraction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-026}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-026/index.html},
eprinttype = {ECCC},
eprint = {TR02-026},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-027,
author = {Irit Dinur and
Venkatesan Guruswami and
Subhash Khot},
title = {Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within
Factor (k-3-epsilon)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-027}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-027/index.html},
eprinttype = {ECCC},
eprint = {TR02-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-028,
author = {Eric Allender and
Harry Buhrman and
Michal Kouck{\'{y}} and
Detlef Ronneburger and
Dieter van Melkebeek},
title = {Power from Random Strings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-028}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-028/index.html},
eprinttype = {ECCC},
eprint = {TR02-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-029,
author = {Marek Karpinski and
Yakov Nekrich},
title = {Parallel Construction of Minimum Redundancy Length-Limited Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-029}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-029/index.html},
eprinttype = {ECCC},
eprint = {TR02-029},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-030,
author = {Lars Engebretsen and
Jonas Holmerin and
Alexander Russell},
title = {Inapproximability Results for Equations over Finite Groups},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-030}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-030/index.html},
eprinttype = {ECCC},
eprint = {TR02-030},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-031,
author = {Vikraman Arvind and
Venkatesh Raman},
title = {Approximate Counting small subgraphs of bounded treewidth and related
problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-031}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-031/index.html},
eprinttype = {ECCC},
eprint = {TR02-031},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-032,
author = {Andrei A. Bulatov},
title = {Tractable Constraint Satisfaction Problems on a 3-element set},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-032}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-032/index.html},
eprinttype = {ECCC},
eprint = {TR02-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-033,
author = {Beate Bollig},
title = {A very simple function that requires exponential size nondeterministic
graph-driven read-once branching programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-033}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-033/index.html},
eprinttype = {ECCC},
eprint = {TR02-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-034,
author = {Andrei A. Bulatov},
title = {Mal'tsev constraints are tractable},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-034}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-034/index.html},
eprinttype = {ECCC},
eprint = {TR02-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-035,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {A Combinatorial Characterization of Resolution Width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-035}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-035/index.html},
eprinttype = {ECCC},
eprint = {TR02-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-036,
author = {Stephen A. Fenner},
title = {PP-lowness and a simple definition of {AWPP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-036}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-036/index.html},
eprinttype = {ECCC},
eprint = {TR02-036},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-037,
author = {Vikraman Arvind and
Piyush P. Kurur},
title = {Graph Isomorphism is in {SPP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-037}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-037/index.html},
eprinttype = {ECCC},
eprint = {TR02-037},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-038,
author = {Rahul Santhanam},
title = {Resource Tradeoffs and Derandomization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-038}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-038/index.html},
eprinttype = {ECCC},
eprint = {TR02-038},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-039,
author = {Oded Goldreich and
Avi Wigderson},
title = {Derandomization that is rarely wrong from short advice that is typically
good},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-039}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-039/index.html},
eprinttype = {ECCC},
eprint = {TR02-039},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-040,
author = {Lars Engebretsen and
Jonas Holmerin},
title = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-040}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-040/index.html},
eprinttype = {ECCC},
eprint = {TR02-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-041,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Claire Kenyon},
title = {A Polynomial Time Approximation Scheme for Metric {MIN-BISECTION}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-041}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-041/index.html},
eprinttype = {ECCC},
eprint = {TR02-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-042,
author = {Dima Grigoriev},
title = {Public-key cryptography and invariant theory},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-042}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-042/index.html},
eprinttype = {ECCC},
eprint = {TR02-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-043,
author = {Dalit Naor and
Moni Naor and
Jeffery Lotspiech},
title = {Revocation and Tracing Schemes for Stateless Receivers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-043}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-043/index.html},
eprinttype = {ECCC},
eprint = {TR02-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-044,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski},
title = {A Polynomial Time Approximation Scheme for Subdense {MAX-CUT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-044}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-044/index.html},
eprinttype = {ECCC},
eprint = {TR02-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-045,
author = {Daniele Micciancio and
Erez Petrank},
title = {Efficient and Concurrent Zero-Knowledge from any public coin {HVZK}
protocol},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-045}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-045/index.html},
eprinttype = {ECCC},
eprint = {TR02-045},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-046,
author = {Marek Karpinski},
title = {On Approximability of Minimum Bisection Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-046}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-046/index.html},
eprinttype = {ECCC},
eprint = {TR02-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-047,
author = {Oded Goldreich},
title = {The {GGM} Construction does {NOT} yield Correlation Intractable Function
Ensembles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-047}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-047/index.html},
eprinttype = {ECCC},
eprint = {TR02-047},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-048,
author = {Noga Alon and
Oded Goldreich and
Yishay Mansour},
title = {Almost k-wise independence versus k-wise independence},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-048}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-048/index.html},
eprinttype = {ECCC},
eprint = {TR02-048},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-049,
author = {Oded Goldreich and
Vered Rosen},
title = {On the Security of Modular Exponentiation with Application to the
Construction of Pseudorandom Generators},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-049}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-049/index.html},
eprinttype = {ECCC},
eprint = {TR02-049},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-050,
author = {Oded Goldreich and
Madhu Sudan},
title = {Locally Testable Codes and PCPs of Almost-Linear Length},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-050}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-050/index.html},
eprinttype = {ECCC},
eprint = {TR02-050},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-051,
author = {Chris Pollett},
title = {Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-051}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-051/index.html},
eprinttype = {ECCC},
eprint = {TR02-051},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-052,
author = {Vince Grolmusz},
title = {Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number
of Multiplications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-052}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-052/index.html},
eprinttype = {ECCC},
eprint = {TR02-052},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-053,
author = {Lars Engebretsen and
Venkatesan Guruswami},
title = {Is Constraint Satisfaction Over Two Variables Always Easy?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-053}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-053/index.html},
eprinttype = {ECCC},
eprint = {TR02-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-054,
author = {Detlef Sieling},
title = {Minimization of Decision Trees is Hard to Approximate},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-054}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-054/index.html},
eprinttype = {ECCC},
eprint = {TR02-054},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-055,
author = {Valentine Kabanets and
Russell Impagliazzo},
title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower
Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-055}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-055/index.html},
eprinttype = {ECCC},
eprint = {TR02-055},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-056,
author = {Todd Ebert and
Wolfgang Merkle and
Heribert Vollmer},
title = {On the Autoreducibility of Random Sequences},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-056}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-056/index.html},
eprinttype = {ECCC},
eprint = {TR02-056},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-057,
author = {Richard J. Lipton and
Anastasios Viglas},
title = {Non-uniform Depth of Polynomial Time and Space Simulations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-057}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-057/index.html},
eprinttype = {ECCC},
eprint = {TR02-057},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-058,
author = {Philippe Moser},
title = {A generalization of Lutz's measure to probabilistic classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-058}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-058/index.html},
eprinttype = {ECCC},
eprint = {TR02-058},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-058.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-059,
author = {Iordanis Kerenidis and
Ronald de Wolf},
title = {Exponential Lower Bound for 2-Query Locally Decodable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-059}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-059/index.html},
eprinttype = {ECCC},
eprint = {TR02-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-060,
author = {Ke Yang},
title = {New Lower Bounds for Statistical Query Learning},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-060}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-060/index.html},
eprinttype = {ECCC},
eprint = {TR02-060},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-061,
author = {Mikl{\'{o}}s Ajtai},
title = {A conjectured 0-1 law about the polynomial time computable properties
of random lattices, {I}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-061}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-061/index.html},
eprinttype = {ECCC},
eprint = {TR02-061},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-062,
author = {Andrew Chi{-}Chih Yao},
title = {Classical Physics and the Church-Turing Thesis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-062}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-062/index.html},
eprinttype = {ECCC},
eprint = {TR02-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-063,
author = {Oded Goldreich},
title = {Zero-Knowledge twenty years after its invention},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-063}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-063/index.html},
eprinttype = {ECCC},
eprint = {TR02-063},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-064,
author = {Andrej Bogdanov and
Luca Trevisan},
title = {Lower Bounds for Testing Bipartiteness in Dense Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-064}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-064/index.html},
eprinttype = {ECCC},
eprint = {TR02-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-065,
author = {Olivier Powell},
title = {Measure on {P} revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-065}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-065/index.html},
eprinttype = {ECCC},
eprint = {TR02-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-066,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
V. Vinay},
title = {Circuits on Cylinders},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-066}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-066/index.html},
eprinttype = {ECCC},
eprint = {TR02-066},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-067,
author = {Marco Cadoli and
Francesco M. Donini and
Paolo Liberatore and
Marco Schaerf},
title = {k-Approximating Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-067}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-067/index.html},
eprinttype = {ECCC},
eprint = {TR02-067},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-068,
author = {Tobias Riege and
J{\"{o}}rg Rothe},
title = {Complexity of the Exact Domatic Number Problem and of the Exact Conveyor
Flow Shop Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-068}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-068/index.html},
eprinttype = {ECCC},
eprint = {TR02-068},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-069,
author = {Luca Trevisan},
title = {A Note on Deterministic Approximate Counting for k-DNF},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-069}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-069/index.html},
eprinttype = {ECCC},
eprint = {TR02-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-070,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski},
title = {9/8-Approximation Algorithm for Random {MAX-3SAT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-070}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-070/index.html},
eprinttype = {ECCC},
eprint = {TR02-070},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-070.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-071,
author = {Bruno Codenotti and
Igor E. Shparlinski},
title = {Non-approximability of the Permanent of Structured Matrices over Finite
Fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-071}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-071/index.html},
eprinttype = {ECCC},
eprint = {TR02-071},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-071.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-072,
author = {Scott Aaronson},
title = {Quantum Lower Bound for Recursive Fourier Sampling},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-072}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-072/index.html},
eprinttype = {ECCC},
eprint = {TR02-072},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-073,
author = {Janka Chleb{\'{\i}}kov{\'{a}} and
Miroslav Chleb{\'{\i}}k},
title = {Approximation Hardness for Small Occurrence Instances of NP-Hard Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-073}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-073/index.html},
eprinttype = {ECCC},
eprint = {TR02-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-074,
author = {Andrew Chi{-}Chih Yao},
title = {On the Power of Quantum Fingerprinting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-074}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-074/index.html},
eprinttype = {ECCC},
eprint = {TR02-074},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-26 16:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
