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/eccc6.bht:"
download as .bib file
@article{DBLP:journals/eccc/ECCC-TR99-001,
author = {Detlef Sieling},
title = {The Complexity of Minimizing FBDDs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-001}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-001/index.html},
eprinttype = {ECCC},
eprint = {TR99-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-002,
author = {Oded Goldreich and
Daniele Micciancio and
Shmuel Safra and
Jean{-}Pierre Seifert},
title = {Approximating Shortest Lattice Vectors is Not Harder Than Approximating
Closest Lattice Vectors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-002}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-002/index.html},
eprinttype = {ECCC},
eprint = {TR99-002},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-003,
author = {Stephen A. Fenner and
Frederic Green and
Steven Homer and
Randall Pruim},
title = {Determining Acceptance Possibility for a Quantum Computation is Hard
for the Polynomial Hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-003}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-003/index.html},
eprinttype = {ECCC},
eprint = {TR99-003},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-004,
author = {Valentine Kabanets},
title = {Almost k-Wise Independence and Boolean Functions Hard for Read-Once
Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-004}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-004/index.html},
eprinttype = {ECCC},
eprint = {TR99-004},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-005,
author = {Michael Schmitt},
title = {On the Sample Complexity for Nonoverlapping Neural Networks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-005}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-005/index.html},
eprinttype = {ECCC},
eprint = {TR99-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-006,
author = {Jin{-}yi Cai},
title = {Some Recent Progress on the Complexity of Lattice Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-006}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-006/index.html},
eprinttype = {ECCC},
eprint = {TR99-006},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-007,
author = {Juraj Hromkovic and
Georg Schnitger},
title = {On the Power of Las Vegas {II:} Two-Way Finite Automata},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-007}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-007/index.html},
eprinttype = {ECCC},
eprint = {TR99-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-008,
author = {Eric Allender and
Vikraman Arvind and
Meena Mahajan},
title = {Arithmetic Complexity, Kleene Closure, and Formal Power Series},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-008}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-008/index.html},
eprinttype = {ECCC},
eprint = {TR99-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-009,
author = {Marek Karpinski and
Rustam Mubarakzjanov},
title = {A Note on Las Vegas OBDDs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-009}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-009/index.html},
eprinttype = {ECCC},
eprint = {TR99-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-010,
author = {Eric Allender and
Igor E. Shparlinski and
Michael E. Saks},
title = {A Lower Bound for Primality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-010}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-010/index.html},
eprinttype = {ECCC},
eprint = {TR99-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-011,
author = {Matthias Krause and
Petr Savick{\'{y}} and
Ingo Wegener},
title = {Approximations by OBDDs and the variable ordering problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-011}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-011/index.html},
eprinttype = {ECCC},
eprint = {TR99-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-012,
author = {Eric Allender and
Andris Ambainis and
David A. Mix Barrington and
Samir Datta and
Huong LeThanh},
title = {Bounded Depth Arithmetic Circuits: Counting and Closure},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-012}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-012/index.html},
eprinttype = {ECCC},
eprint = {TR99-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-013,
author = {Oded Goldreich and
Amit Sahai and
Salil P. Vadhan},
title = {Can Statistical Zero Knowledge be made Non-Interactive? or On the
Relationship of {SZK} and {NISZK}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-013}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-013/index.html},
eprinttype = {ECCC},
eprint = {TR99-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-014,
author = {Alexander A. Razborov and
Nikolai K. Vereshchagin},
title = {One Property of Cross-Intersecting Families},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-014}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-014/index.html},
eprinttype = {ECCC},
eprint = {TR99-014},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-015,
author = {Irit Dinur and
Shmuel Safra},
title = {On the Hardness of Approximating Label Cover},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-015}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-015/index.html},
eprinttype = {ECCC},
eprint = {TR99-015},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-016,
author = {Irit Dinur},
title = {Approximating SVP\({}_{\mbox{infty}}\) to within Almost-Polynomial
Factors is NP-hard},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-016}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-016/index.html},
eprinttype = {ECCC},
eprint = {TR99-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-017,
author = {Yevgeniy Dodis and
Oded Goldreich and
Eric Lehman and
Sofya Raskhodnikova and
Dana Ron and
Alex Samorodnitsky},
title = {Improved Testing Algorithms for Monotonicity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-017}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-017/index.html},
eprinttype = {ECCC},
eprint = {TR99-017},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-018,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Reducing Randomness via Chinese Remaindering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-018}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-018/index.html},
eprinttype = {ECCC},
eprint = {TR99-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-019,
author = {Detlef Sieling},
title = {Lower Bounds for Linear Transformed OBDDs and FBDDs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-019}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-019/index.html},
eprinttype = {ECCC},
eprint = {TR99-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-020,
author = {Marek Karpinski},
title = {Randomized Complexity of Linear Arrangements and Polyhedra},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-020}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-020/index.html},
eprinttype = {ECCC},
eprint = {TR99-020},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-021,
author = {Igor E. Shparlinski},
title = {On the Uniformity of Distribution of a Certain Pseudo-Random Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-021}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-021/index.html},
eprinttype = {ECCC},
eprint = {TR99-021},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-022,
author = {Eli Ben{-}Sasson and
Avi Wigderson},
title = {Short Proofs are Narrow - Resolution made Simple},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-022}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-022/index.html},
eprinttype = {ECCC},
eprint = {TR99-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-023,
author = {Amir Shpilka and
Avi Wigderson},
title = {Depth-3 Arithmetic Formulae over Fields of Characteristic Zero},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-023}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-023/index.html},
eprinttype = {ECCC},
eprint = {TR99-023},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-024,
author = {Oded Goldreich and
Shafi Goldwasser and
Silvio Micali},
title = {Interleaved Zero-Knowledge in the Public-Key Model},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-024}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-024/index.html},
eprinttype = {ECCC},
eprint = {TR99-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-025,
author = {Yonatan Aumann and
Johan H{\aa}stad and
Michael O. Rabin and
Madhu Sudan},
title = {Linear Consistency Testing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-025}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-025/index.html},
eprinttype = {ECCC},
eprint = {TR99-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-026,
author = {Mikl{\'{o}}s Ajtai},
title = {A Non-linear Time Lower Bound for Boolean Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-026}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-026/index.html},
eprinttype = {ECCC},
eprint = {TR99-026},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-027,
author = {Marek Karpinski and
Igor E. Shparlinski},
title = {On the Computational Hardness of Testing Square-Freeness of Sparse
Polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-027}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-027/index.html},
eprinttype = {ECCC},
eprint = {TR99-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-028,
author = {Stefan Edelkamp and
Ingo Wegener},
title = {On the performance of {WEAK-HEAPSORT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-028}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-028/index.html},
eprinttype = {ECCC},
eprint = {TR99-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-029,
author = {Ilya Dumer and
Daniele Micciancio and
Madhu Sudan},
title = {Hardness of Approximating the Minimum Distance of a Linear Code},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-029}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-029/index.html},
eprinttype = {ECCC},
eprint = {TR99-029},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-030,
author = {Meena Mahajan and
P. R. Subramanya and
V. Vinay},
title = {A Combinatorial Algorithm for Pfaffians},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-030}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-030/index.html},
eprinttype = {ECCC},
eprint = {TR99-030},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-031,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Ralf Klasing and
Sebastian Seibert and
Walter Unger},
title = {Towards the Notion of Stability of Approximation for Hard Optimization
Tasks and the Traveling Salesman Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-031}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-031/index.html},
eprinttype = {ECCC},
eprint = {TR99-031},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-032,
author = {Cristopher Moore},
title = {Quantum Circuits: Fanout, Parity, and Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-032}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-032/index.html},
eprinttype = {ECCC},
eprint = {TR99-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-033,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler},
title = {Graph Isomorphism is Low for ZPP\({}^{\mbox{NP}}\) and other Lowness
results},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-033}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-033/index.html},
eprinttype = {ECCC},
eprint = {TR99-033},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-034,
author = {Wolfgang Merkle},
title = {The Global Power of Additional Queries to p-random Oracles},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-034}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-034/index.html},
eprinttype = {ECCC},
eprint = {TR99-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-035,
author = {Leonard J. Schulman},
title = {Clustering for Edge-Cost Minimization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-035}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-035/index.html},
eprinttype = {ECCC},
eprint = {TR99-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-036,
author = {Edward A. Hirsch},
title = {A New Algorithm for {MAX-2-SAT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-036}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-036/index.html},
eprinttype = {ECCC},
eprint = {TR99-036},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-037,
author = {Johan H{\aa}stad and
Mats N{\"{a}}slund},
title = {The Security of all {RSA} and Discrete Log Bits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-037}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-037/index.html},
eprinttype = {ECCC},
eprint = {TR99-037},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-038,
author = {Peter Jonsson and
Paolo Liberatore},
title = {On the Complexity of Finding Satisfiable Subinstances in Constraint
Satisfaction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-038}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-038/index.html},
eprinttype = {ECCC},
eprint = {TR99-038},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-039,
author = {Johan H{\aa}stad},
title = {On approximating {CSP-B}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-039}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-039/index.html},
eprinttype = {ECCC},
eprint = {TR99-039},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-040,
author = {Michael Alekhnovich and
Eli Ben{-}Sasson and
Alexander A. Razborov and
Avi Wigderson},
title = {Space Complexity in Propositional Calculus},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-040}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-040/index.html},
eprinttype = {ECCC},
eprint = {TR99-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-041,
author = {Oliver Kullmann},
title = {Investigating a general hierarchy of polynomially decidable classes
of CNF's based on short tree-like resolution proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-041}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-041/index.html},
eprinttype = {ECCC},
eprint = {TR99-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-042,
author = {Ran Canetti and
Oded Goldreich and
Shafi Goldwasser and
Silvio Micali},
title = {Resettable Zero-Knowledge},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-042}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-042/index.html},
eprinttype = {ECCC},
eprint = {TR99-042},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-043,
author = {Venkatesan Guruswami},
title = {The Approximability of Set Splitting Problems and Satisfiability Problems
with no Mixed Clauses},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-043}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-043/index.html},
eprinttype = {ECCC},
eprint = {TR99-043},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-044,
author = {Farid M. Ablayev},
title = {On Complexity of Regular (1,+k)-Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-044}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-044/index.html},
eprinttype = {ECCC},
eprint = {TR99-044},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-044.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-045,
author = {Valentine Kabanets and
Jin{-}yi Cai},
title = {Circuit Minimization Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-045}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-045/index.html},
eprinttype = {ECCC},
eprint = {TR99-045},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-045.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-046,
author = {Ran Raz and
Omer Reingold and
Salil P. Vadhan},
title = {Extracting All the Randomness and Reducing the Error in Trevisan's
Extractors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-046}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-046/index.html},
eprinttype = {ECCC},
eprint = {TR99-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-047,
author = {Wolfgang Slany},
title = {Graph Ramsey games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-047}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-047/index.html},
eprinttype = {ECCC},
eprint = {TR99-047},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-048,
author = {Beate Bollig and
Ingo Wegener},
title = {Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic
{OBDD} Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-048}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-048/index.html},
eprinttype = {ECCC},
eprint = {TR99-048},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-048.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-05-24 20:41 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:
