363
click to vote
CC
10 years 29 days ago
2015 Springer 
We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game G of entangled value 1 − ε...
271
click to vote
CC
10 years 29 days ago
2015 Springer
We present a polynomial-time deterministic algorithm for testing whether constant-read multilinear arithmetic formulae are identically zero. In such a formula each variable occurs ...
266
click to vote
CC
10 years 29 days ago
2015 Springer
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that t...
253
click to vote
CC
10 years 29 days ago
2015 Springer
This paper characterizes alternation-trading based proofs that the Boolean satisfiability problem is not in the time and space
|
System Software