Sciweavers

1209 search results - page 132 / 242
» Universal Algebra and Computer Science
Sort
View
117
Voted
APAL
2002
73views more  APAL 2002»
15 years 3 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
143
Voted
JACM
2010
116views more  JACM 2010»
15 years 1 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
292
Voted

Book
813views
16 years 11 months ago
Mathematical Tools for Physics
"I wrote this text for a one semester course at the sophomore-junior level. Our experience with students taking our junior physics courses is that even if they've had th...
James Nearing
FSTTCS
2009
Springer
15 years 10 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
129
Voted
DAGSTUHL
2006
15 years 4 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter