876 search results - page 14 / 176 » New Results for the Martin Polynomial |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
DAM
2010
13 years 8 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
CRYPTO
2000
Springer
14 years 29 days ago
2000
Springer
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...