89 search results - page 3 / 18 » Effective Set Membership in Computer Algebra and Beyond |
TOCL
2002
13 years 5 months ago
2002
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
CSE
2009
IEEE
13 years 9 months ago
2009
IEEE
Abstract--Web 2.0 users have many choices of contenthosting or application-service providers (CSPs). It can be difficult for a user to share content with a set of real-life friends...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
IFIPTCS
2010
13 years 3 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inp...