650 search results - page 43 / 130 » On Coalgebras over Algebras |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
ACMMPC
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an ext...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
ENTCS
2006
13 years 7 months ago
2006
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Ita...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...