Efficient constructions of Hitting Sets for systems of linear functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 387-398

  Andreev, Alexander E ^a   Clementi, Andrea E F ^b   Rolim, José D P ^c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

CIRCUIT COMPLEXITY; DETERMINISTIC METHODS; EFFICIENT CONSTRUCTION; LINEAR FUNCTIONS; MONOTONE FUNCTIONS; POSITIVE NUMBERS; RECTANGULAR FUNCTION; SYSTEMS OF LINEAR EQUATIONS;

DELTA FUNCTIONS;

EID: 11744388101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023475     Document Type: Conference Paper

References (15)

1. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), "Towards efficient constructions of hitting sets that derandomize BPP", Research Report in ECCC, TR-96-029.
2. Allender E, Beals R, and Ogihara M. (1996), "The complexity of matrix rank and feasible systems of linear equations", in Proc. of 28-th ACM STOC, to appear. Also available by ftp/www in ECCC (Tech. Rep. 1996).
3. Andreev, A.E. (1989), On the complexity of the realization of partial Boolean functions by circuits of functional elements, Diskret. mat. 1, pp.36-45. (In Russian). English translation in Discrete Mathematics and Applications 1, pp.251-262.
4. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), "Hitting Sets derandomize BPP", in Proc. of 23-th ICALP LNCS, Springer-Verlag, to appear. Also available by ftp/www in ECCC (Tech. Rep. 1996).
5. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), "Optimal bounds for the approximation of boolean functions and some applications", in Proc. of 13th STACS, LNCS, Springer-Verlag (1996). Also available by ftp/www in ECCC (Tech. Rep. 1995).
6. Andreev A.E., Clementi A.E.F. and Rolim J.D.P. (1996), "On the parallel computation of boolean functions on unrelated inputs", in Proc. of 4-th Israeli Symposium on Theory of Computing and Systems (ISTCS'96), to appear.
7. Chor B., and O. Goldreich (1989), "On the Power of Two-Point Based Sampling", J. Complexity, 5, 96-106.
8. Furedi, Z. (1988) "Matchings and Covers in Hypergraphs", Graphs and Combinatorics, 4, 115-206.
9. Karp R., Pippenger N., and Sipser M. (1982) "Time-Randomness, Tradeoff", presented at AMS Conference on Probabilistic Computational Complexity.
10. Karpinski, M., and Luby, M. (1993), "Approximating the number of solutions to a GF(2) Formula", J. Algorithms, 14, pp.280-287.
11. Linial N., Luby M., Saks M., and Zuckerman D. (1993), "Efficient construction of a small hitting set for combinatorial rectangles in high dimension", in Proc. 25th ACM STOC, 258-267.
12. Lupanov, O.B. (1965), "About a method circuits design - local coding principle", Problemy Kibernet. 14, pp.31-110. (in Russian). Systems Theory Res. v.14, 1966 (in English).
13. Nechiporuk, E.I. (1965), About the complexity of gating circuits for the partial boolean matrix, Dokl. Akad. Nauk SSSR 163, pp.40-42. (In Russian). English translation in Soviet Math. Docl.
14. Nisan N., and Wigderson A. (1994), "Hardness vs Randomness", J. Comput. System Sci. 49, 149-167 (also presented at the 29th IEEE FOCS, 1988).
15. Sipser M. (1986), "Expanders, Randomness or Time vs Space", in Proc. of 1st Conference on Structures in Complexity Theory, LNCS 223, 325-329.