Schwartz–Zippel lemma

Results: 10



#Item
1Finding a path of length k in O∗(2k ) time  arXiv:0807.3026v3 [cs.DS] 9 Nov 2008 Ryan Williams∗ Carnegie Mellon University

Finding a path of length k in O∗(2k ) time arXiv:0807.3026v3 [cs.DS] 9 Nov 2008 Ryan Williams∗ Carnegie Mellon University

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2008-11-08 20:04:23
2Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1

Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2011-03-10 13:51:53
3On the Analysis of Cryptographic Assumptions in the Generic Ring Model Tibor Jager∗ Institut für Kryptographie und Sicherheit Karlsruhe Institute of Technology

On the Analysis of Cryptographic Assumptions in the Generic Ring Model Tibor Jager∗ Institut für Kryptographie und Sicherheit Karlsruhe Institute of Technology

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-01-25 16:56:30
4Orthogonal basis for functions over a slice of the Boolean hypercube Yuval Filmus Institute for Advanced Study, Princeton, NJ November 20, 2014 Abstract We present a simple, explicit orthogonal basis of eigenvectors for

Orthogonal basis for functions over a slice of the Boolean hypercube Yuval Filmus Institute for Advanced Study, Princeton, NJ November 20, 2014 Abstract We present a simple, explicit orthogonal basis of eigenvectors for

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-11-20 17:32:17
5Algebraic Algorithms for Matching and Matroid Problems Nicholas J. A. Harvey Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Abstract

Algebraic Algorithms for Matching and Matroid Problems Nicholas J. A. Harvey Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Abstract

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2008-10-04 08:08:33
6The Multivariate Ising Polynomial of a Graph Daniel Andr´en and Klas Markstr¨ om Abstract. In this paper we discuss the two variable Ising polynomial in a graph theoretical setting. This polynomial has its origin in ph

The Multivariate Ising Polynomial of a Graph Daniel Andr´en and Klas Markstr¨ om Abstract. In this paper we discuss the two variable Ising polynomial in a graph theoretical setting. This polynomial has its origin in ph

Add to Reading List

Source URL: abel.math.umu.se

Language: English - Date: 2013-12-11 09:07:22
7Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2

Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2

Add to Reading List

Source URL: www.ias.ac.in

Language: English - Date: 2010-02-23 06:21:54
8The GCT program towards the P vs. NP problem Dedicated to Sri Ramakrishna Ketan D. Mulmuley The University of Chicago (To appear in CACM)

The GCT program towards the P vs. NP problem Dedicated to Sri Ramakrishna Ketan D. Mulmuley The University of Chicago (To appear in CACM)

Add to Reading List

Source URL: ramakrishnadas.cs.uchicago.edu

Language: English - Date: 2012-10-26 13:45:34
9Exhaustive search methods for CNS polynomials P´eter Burcsi∗ and Attila Kov´acs† Department of Computer Algebra, E¨otv¨os Lor´and University, H-1117 Budapest, Hungary {peter.burcsi, attila.kovacs}@compalg.inf.el

Exhaustive search methods for CNS polynomials P´eter Burcsi∗ and Attila Kov´acs† Department of Computer Algebra, E¨otv¨os Lor´and University, H-1117 Budapest, Hungary {peter.burcsi, attila.kovacs}@compalg.inf.el

Add to Reading List

Source URL: szdg.lpds.sztaki.hu

Language: English - Date: 2009-02-03 10:33:19
10Unconditional Pseudorandom Generators for Low-Degree Polynomials

Unconditional Pseudorandom Generators for Low-Degree Polynomials

Add to Reading List

Source URL: www.theoryofcomputing.org

Language: English - Date: 2013-01-22 04:13:53