Sciweavers

650 search results - page 44 / 130
» On Coalgebras over Algebras
Sort
View
JCT
2010
98views more  JCT 2010»
13 years 2 months ago
Lifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
Rudi Pendavingh, Stefan H. M. van Zwam
CSUR
1999
137views more  CSUR 1999»
13 years 7 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
13 years 12 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ACS
2010
13 years 7 months ago
Sequentially Dense Essential Monomorphisms of Acts Over Semigroups
The class Md of sequentially dense monomorphisms were first defined and studied by Giuli, Ebrahimi, and Mahmoudi for projection algebras (acts over the monoid (N , min), of interes...
M. Mahmoudi, L. Shahbaz
IANDC
2007
133views more  IANDC 2007»
13 years 7 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich