Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/eccc/eccc4.bht:"
@article{DBLP:journals/eccc/ECCC-TR97-001, author = {Marco Cesati and Luca Trevisan}, title = {On the Efficiency of Polynomial Time Approximation Schemes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-001}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-001/index.html}, eprinttype = {ECCC}, eprint = {TR97-001}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-002, author = {Richard Beigel and Alexis Maciel}, title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-002}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-002/index.html}, eprinttype = {ECCC}, eprint = {TR97-002}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-002.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-003, author = {Sanjeev Arora and Madhu Sudan}, title = {Improved low-degree testing and its applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-003}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-003/index.html}, eprinttype = {ECCC}, eprint = {TR97-003}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-004, author = {Marek Karpinski and Alexander Zelikovsky}, title = {Approximating Dense Cases of Covering Problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-004}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-004/index.html}, eprinttype = {ECCC}, eprint = {TR97-004}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-004.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-005, author = {Moni Naor and Omer Reingold}, title = {On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-005}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-005/index.html}, eprinttype = {ECCC}, eprint = {TR97-005}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-006, author = {Marco Cesati and Miriam Di Ianni}, title = {Parameterized Parallel Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-006}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-006/index.html}, eprinttype = {ECCC}, eprint = {TR97-006}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-007, author = {Stasys Jukna}, title = {Exponential Lower Bounds for Semantic Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-007}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-007/index.html}, eprinttype = {ECCC}, eprint = {TR97-007}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-008, author = {Noam Nisan and Ziv Bar{-}Yossef}, title = {Pointer Jumping Requires Concurrent Read}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-008}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-008/index.html}, eprinttype = {ECCC}, eprint = {TR97-008}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-008.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-009, author = {Jonathan F. Buss and Gudmund Skovbjerg Frandsen and Jeffrey O. Shallit}, title = {The Computational Complexity of Some Problems of Linear Algebra}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-009}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-009/index.html}, eprinttype = {ECCC}, eprint = {TR97-009}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-009.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-010, author = {Marcos A. Kiwi}, title = {Testing and Weight Distributions of Dual Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-010}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-010/index.html}, eprinttype = {ECCC}, eprint = {TR97-010}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-010.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-011, author = {Alexander E. Andreev and Andrea E. F. Clementi and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {Weak Random Sources, Hitting Sets, and {BPP} Simulations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-011}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-011/index.html}, eprinttype = {ECCC}, eprint = {TR97-011}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-011.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-012, author = {Luca Trevisan}, title = {On Local versus Global Satisfiability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-012}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-012/index.html}, eprinttype = {ECCC}, eprint = {TR97-012}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-012.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-013, author = {Bernd Borchert and Dietrich Kuske and Frank Stephan}, title = {On Existentially First-Order Definable Languages and their Relation to {NP}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-013}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-013/index.html}, eprinttype = {ECCC}, eprint = {TR97-013}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-014, author = {Klaus Reinhardt and Eric Allender}, title = {Making Nondeterminism Unambiguous}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-014}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-014/index.html}, eprinttype = {ECCC}, eprint = {TR97-014}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-015, author = {Jan Kraj{\'{\i}}cek}, title = {Interpolation by a Game}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-015}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-015/index.html}, eprinttype = {ECCC}, eprint = {TR97-015}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-016, author = {Manindra Agrawal and Eric Allender and Samir Datta}, title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-016}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-016/index.html}, eprinttype = {ECCC}, eprint = {TR97-016}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-017, author = {Marek Karpinski and Juergen Wirtgen and Alexander Zelikovsky}, title = {An Approximation Algorithm for the Bandwidth Problem on Dense Graphs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-017}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-017/index.html}, eprinttype = {ECCC}, eprint = {TR97-017}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-018, author = {Oded Goldreich and Shafi Goldwasser and Shai Halevi}, title = {Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-018}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-018/index.html}, eprinttype = {ECCC}, eprint = {TR97-018}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-019, author = {Martin Sauerhoff}, title = {A Lower Bound for Randomized Read-k-Times Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-019}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-019/index.html}, eprinttype = {ECCC}, eprint = {TR97-019}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-020, author = {Oded Goldreich}, title = {A Sample of Samplers - {A} Computational Perspective on Sampling (survey)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-020}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-020/index.html}, eprinttype = {ECCC}, eprint = {TR97-020}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-020.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-021, author = {Farid M. Ablayev}, title = {Randomization and nondeterminsm are incomparable for ordered read-once branching programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-021}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-021/index.html}, eprinttype = {ECCC}, eprint = {TR97-021}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-022, author = {Gunnar Andersson and Lars Engebretsen}, title = {Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-022}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-022/index.html}, eprinttype = {ECCC}, eprint = {TR97-022}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-023, author = {Stasys Jukna and Alexander A. Razborov and Petr Savick{\'{y}} and Ingo Wegener}, title = {On {P} versus {NP} {\textbackslash}cap co-NP for Decision Trees and Read-Once Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-023}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-023/index.html}, eprinttype = {ECCC}, eprint = {TR97-023}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-024, author = {Marek Karpinski}, title = {Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-024}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-024/index.html}, eprinttype = {ECCC}, eprint = {TR97-024}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-024.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-025, author = {Harald Hempel and Gerd Wechsung}, title = {The Operators min and max on the Polynomial Hierarchy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-025}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-025/index.html}, eprinttype = {ECCC}, eprint = {TR97-025}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-025.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-026, author = {Jochen Me{\ss}ner and Jacobo Tor{\'{a}}n}, title = {Optimal proof systems for Propositional Logic and complete sets}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-026}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-026/index.html}, eprinttype = {ECCC}, eprint = {TR97-026}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-026.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-027, author = {Johannes Merkle and Ralph Werchner}, title = {On the Security of Server aided {RSA} protocols}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-027}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-027/index.html}, eprinttype = {ECCC}, eprint = {TR97-027}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-027.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-028, author = {Scott E. Decatur and Oded Goldreich and Dana Ron}, title = {Computational Sample Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-028}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-028/index.html}, eprinttype = {ECCC}, eprint = {TR97-028}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-028.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-029, author = {Pavol Duris and Juraj Hromkovic and Jos{\'{e}} D. P. Rolim and Georg Schnitger}, title = {On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-029}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-029/index.html}, eprinttype = {ECCC}, eprint = {TR97-029}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-029.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-030, author = {Martin Sauerhoff}, title = {On Nondeterminism versus Randomness for Read-Once Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-030}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-030/index.html}, eprinttype = {ECCC}, eprint = {TR97-030}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-030.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-031, author = {Oded Goldreich and Shafi Goldwasser}, title = {On the Limits of Non-Approximability of Lattice Problems}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-031}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-031/index.html}, eprinttype = {ECCC}, eprint = {TR97-031}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-031.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-032, author = {Jan Johannsen}, title = {Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-032}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-032/index.html}, eprinttype = {ECCC}, eprint = {TR97-032}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-032.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-033, author = {Meena Mahajan and Venkatesh Raman}, title = {Parametrizing Above Guaranteed Values: MaxSat and MaxCut}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-033}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-033/index.html}, eprinttype = {ECCC}, eprint = {TR97-033}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-033.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-034, author = {Jui{-}Lin Lee}, title = {Counting in Uniform TC\({}^{\mbox{0}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-034}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-034/index.html}, eprinttype = {ECCC}, eprint = {TR97-034}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-034.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-035, author = {Richard Chang}, title = {Bounded Queries, Approximations and the Boolean Hierarchy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-035}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-035/index.html}, eprinttype = {ECCC}, eprint = {TR97-035}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-035.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-036, author = {Meena Mahajan and V. Vinay}, title = {Determinant: Combinatorics, Algorithms, and Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-036}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-036/index.html}, eprinttype = {ECCC}, eprint = {TR97-036}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-036.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-037, author = {Johan H{\aa}stad}, title = {Some optimal inapproximability results}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-037}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-037/index.html}, eprinttype = {ECCC}, eprint = {TR97-037}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-037.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-038, author = {Johan H{\aa}stad}, title = {Clique is hard to approximate within n\({}^{\mbox{1-epsilon}}\)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-038}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-038/index.html}, eprinttype = {ECCC}, eprint = {TR97-038}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-038.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-039, author = {Pierluigi Crescenzi and Luca Trevisan}, title = {{MAX} NP-Completeness Made Easy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-039}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-039/index.html}, eprinttype = {ECCC}, eprint = {TR97-039}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-039.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-040, author = {Dorit Dor and Shay Halperin and Uri Zwick}, title = {All Pairs Almost Shortest Paths}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-040}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-040/index.html}, eprinttype = {ECCC}, eprint = {TR97-040}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-040.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-041, author = {Marek Karpinski and Juergen Wirtgen}, title = {On Approximation Hardness of the Bandwidth Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-041}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-041/index.html}, eprinttype = {ECCC}, eprint = {TR97-041}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-041.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-042, author = {Russell Impagliazzo and Pavel Pudl{\'{a}}k and Jir{\'{\i}} Sgall}, title = {Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-042}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-042/index.html}, eprinttype = {ECCC}, eprint = {TR97-042}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-042.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-043, author = {Bruno Codenotti and Pavel Pudl{\'{a}}k and Giovanni Resta}, title = {Some structural properties of low rank matrices related to computational complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-043}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-043/index.html}, eprinttype = {ECCC}, eprint = {TR97-043}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-043.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-044, author = {David A. Mix Barrington and Chi{-}Jen Lu and Peter Bro Miltersen and Sven Skyum}, title = {Searching constant width mazes captures the AC\({}^{\mbox{0}}\) hierarchy}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-044}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-044/index.html}, eprinttype = {ECCC}, eprint = {TR97-044}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-044.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-045, author = {Oded Goldreich and David Zuckerman}, title = {Another proof that {BPP} subseteq {PH} (and more)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-045}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-045/index.html}, eprinttype = {ECCC}, eprint = {TR97-045}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-045.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-046, author = {Alexander Barg}, title = {Complexity Issues in Coding Theory}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-046}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-046/index.html}, eprinttype = {ECCC}, eprint = {TR97-046}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-046.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-047, author = {Mikl{\'{o}}s Ajtai}, title = {The Shortest Vector Problem in L\({}_{\mbox{2}}\) is NP-hard for Randomized Reductions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-047}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-047/index.html}, eprinttype = {ECCC}, eprint = {TR97-047}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-047.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-048, author = {S{\o}ren Riis and Meera Sitharam}, title = {Non-constant Degree Lower Bounds imply linear Degree Lower Bounds}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-048}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-048/index.html}, eprinttype = {ECCC}, eprint = {TR97-048}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-048.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-049, author = {Wolfgang Maass and Michael Schmitt}, title = {On the Complexity of Learning for Spiking Neurons with Temporal Coding}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-049}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-049/index.html}, eprinttype = {ECCC}, eprint = {TR97-049}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-049.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-050, author = {Stanislav Z{\'{a}}k}, title = {A subexponential lower bound for branching programs restricted with regard to some semantic aspects}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-050}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-050/index.html}, eprinttype = {ECCC}, eprint = {TR97-050}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-050.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-051, author = {Wolfgang Maass and Pekka Orponen}, title = {On the Effect of Analog Noise in Discrete-Time Analog Computations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-051}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-051/index.html}, eprinttype = {ECCC}, eprint = {TR97-051}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-051.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-052, author = {Wolfgang Maass and Eduardo D. Sontag}, title = {Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-052}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-052/index.html}, eprinttype = {ECCC}, eprint = {TR97-052}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-052.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-053, author = {Alexander E. Andreev and Juri L. Baskakov and Andrea E. F. Clementi and Jos{\'{e}} D. P. Rolim}, title = {Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-053}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-053/index.html}, eprinttype = {ECCC}, eprint = {TR97-053}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-053.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-054, author = {Ran Raz and G{\'{a}}bor Tardos and Oleg Verbitsky and Nikolai K. Vereshchagin}, title = {Arthur-Merlin Games in Boolean Decision Trees}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-054}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-054/index.html}, eprinttype = {ECCC}, eprint = {TR97-054}, timestamp = {Thu, 13 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-054.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-055, author = {Bruce E. Litow}, title = {A Decision Method for the Rational Sequence Problem}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-055}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-055/index.html}, eprinttype = {ECCC}, eprint = {TR97-055}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-055.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-056, author = {Oded Goldreich}, title = {Combinatorial Property Testing (a survey)}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-056}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-056/index.html}, eprinttype = {ECCC}, eprint = {TR97-056}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-056.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-057, author = {Petr Savick{\'{y}}}, title = {Complexity and Probability of some Boolean Formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-057}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-057/index.html}, eprinttype = {ECCC}, eprint = {TR97-057}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-057.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-058, author = {Oded Goldreich}, title = {Notes on Levin's Theory of Average-Case Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-058}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-058/index.html}, eprinttype = {ECCC}, eprint = {TR97-058}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-058.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-059, author = {Jin{-}yi Cai and Ajay Nerurkar}, title = {Approximating the {SVP} to within a factor {(1} + 1/dim\({}^{\mbox{epsilon}}\)) is NP-hard under randomized reductions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-059}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-059/index.html}, eprinttype = {ECCC}, eprint = {TR97-059}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-059.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-060, author = {Manindra Agrawal and Thomas Thierauf}, title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-060}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-060/index.html}, eprinttype = {ECCC}, eprint = {TR97-060}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-060.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR97-061, author = {Eli Biham and Dan Boneh and Omer Reingold}, title = {Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR97-061}}, year = {1997}, url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-061/index.html}, eprinttype = {ECCC}, eprint = {TR97-061}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-061.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.