255
click to vote
CC
2015
Springer
10 years 19 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...
259
click to vote
CC
2015
Springer
10 years 19 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 ...
352
click to vote
CC
2015
Springer
10 years 19 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 − ε...
240
click to vote
CC
2015
Springer
10 years 19 days ago
2015
Springer
This paper characterizes alternation-trading based proofs that the Boolean satisfiability problem is not in the time and space
215
click to vote
CC
2015
Springer
10 years 19 days ago
2015
Springer
Modeling languages for hybrid systems are cornerstones of embedded systems development in which software interacts with a physical environment. Sequential code generation from such...
224
click to vote
CC
2015
Springer
10 years 19 days ago
2015
Springer
Abstract. In many data processing tasks, declarative query programming offers substantial benefit over manual data analysis: the query processors found in declarative systems can...
