Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarSylvain Perifel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c9]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. SODA 2018: 1478-1495- 2017
- [i10]Guillaume Lagarde, Sylvain Perifel:
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy. CoRR abs/1707.04312 (2017) - 2016
- [i9]Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Electronic Colloquium on Computational Complexity (ECCC) 23: 94 (2016) - 2015
- [j7]Hervé Fournier, Sylvain Perifel, Rémi de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. Inf. Comput. 240: 31-41 (2015) - 2013
- [c8]Hervé Fournier, Sylvain Perifel, Rémi de Verclos:
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. MFCS 2013: 433-444 - [i8]Hervé Fournier, Sylvain Perifel, Rémi de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. CoRR abs/1304.5910 (2013) - 2012
- [c7]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. STOC 2012: 615-624 - 2011
- [j6]Pascal Koiran, Sylvain Perifel:
Interpolation in Valiant's Theory. Computational Complexity 20(1): 1-20 (2011) - [j5]Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. Theory Comput. Syst. 48(4): 731-766 (2011) - [i7]Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff:
Separating multilinear branching programs and formulas. Electronic Colloquium on Computational Complexity (ECCC) 18: 134 (2011)
2000 – 2009
- 2009
- [j4]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Reals. Computational Complexity 18(4): 551-575 (2009) - [j3]Pascal Koiran, Sylvain Perifel:
VPSPACE and a transfer theorem over the complex field. Theor. Comput. Sci. 410(50): 5244-5251 (2009) - [c6]Pascal Koiran, Sylvain Perifel:
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. IEEE Conference on Computational Complexity 2009: 35-40 - [i6]Pascal Koiran, Sylvain Perifel:
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent. CoRR abs/0902.1866 (2009) - [i5]Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. CoRR abs/0903.4101 (2009) - 2008
- [j2]Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors. J. Complexity 24(1): 39-53 (2008) - [c5]Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. STACS 2008: 39-48 - 2007
- [j1]Pascal Koiran, Sylvain Perifel:
The complexity of two problems on arithmetic circuits. Theor. Comput. Sci. 389(1-2): 172-181 (2007) - [c4]
- [c3]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Complex Field. MFCS 2007: 359-370 - [c2]
- [i4]Pascal Koiran, Sylvain Perifel:
VPSPACE and a transfer theorem over the complex field. CoRR abs/0706.1477 (2007) - [i3]Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. CoRR abs/0709.2346 (2007) - [i2]
- 2006
- [c1]Pascal Koiran, Sylvain Perifel:
Valiant's Model: From Exponential Sums to Exponential Products. MFCS 2006: 596-607 - [i1]Pascal Koiran, Sylvain Perifel:
VPSPACE and a Transfer Theorem over the Reals. CoRR abs/cs/0610009 (2006)
Coauthor Index
maintained by 
at 
at 
last updated on 2018-11-07 20:57 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint