1![Finding 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](https://www.pdfsearch.io/img/77dffb1de71bc297b83dcf1d0e9bbbf7.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2008-11-08 20:04:23
|
---|
2![Arithmetic 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](https://www.pdfsearch.io/img/542edf7b4fc803890f1170b951246092.jpg) | Add to Reading ListSource URL: www.cs.technion.ac.ilLanguage: English - Date: 2011-03-10 13:51:53
|
---|
3![On 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](https://www.pdfsearch.io/img/9f1c257b2a0e6375b39390d5c4328512.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2012-01-25 16:56:30
|
---|
4![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 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](https://www.pdfsearch.io/img/cd3477744ae9873a4cfa763b890a87a0.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2014-11-20 17:32:17
|
---|
5![Algebraic 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](https://www.pdfsearch.io/img/8165267eac22eace73367293ec21c2a3.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2008-10-04 08:08:33
|
---|
6![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 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](https://www.pdfsearch.io/img/097574e098eeb9188f67158e19944828.jpg) | Add to Reading ListSource URL: abel.math.umu.seLanguage: English - Date: 2013-12-11 09:07:22
|
---|
7![Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2 Classifying polynomials and identity testing MANINDRA AGRAWAL1,∗ and RAMPRASAD SAPTHARISHI2 1 2](https://www.pdfsearch.io/img/810cdd5fe31c90c253ba5c69fd5314f6.jpg) | Add to Reading ListSource URL: www.ias.ac.inLanguage: English - Date: 2010-02-23 06:21:54
|
---|
8![The 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)](https://www.pdfsearch.io/img/da56fa147386121d7b8cff6405e49bea.jpg) | Add to Reading ListSource URL: ramakrishnadas.cs.uchicago.eduLanguage: English - Date: 2012-10-26 13:45:34
|
---|
9![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 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](https://www.pdfsearch.io/img/2ef295385f2da9fb631e6c7de2a8b82d.jpg) | Add to Reading ListSource URL: szdg.lpds.sztaki.huLanguage: English - Date: 2009-02-03 10:33:19
|
---|
10![Unconditional Pseudorandom Generators for Low-Degree Polynomials Unconditional Pseudorandom Generators for Low-Degree Polynomials](https://www.pdfsearch.io/img/b435048137a8702da6b145a00d808a4c.jpg) | Add to Reading ListSource URL: www.theoryofcomputing.orgLanguage: English - Date: 2013-01-22 04:13:53
|
---|