CORR
2008
Springer
14 years 18 days ago
2008
Springer
CORR
2008
Springer
14 years 18 days ago
2008
Springer
CORR
2008
Springer
14 years 18 days ago
2008
Springer
CORR
2008
Springer
14 years 18 days ago
2008
Springer
CORR
2008
Springer
14 years 18 days ago
2008
Springer
This paper examines the possibility of discovering 'hidden' (potential) Communities of Practice (CoPs) inside electronic networks, and then using this knowledge to nurtu...
CORR
2008
Springer
14 years 18 days ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
CORR
2008
Springer
14 years 18 days ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
CORR
2008
Springer
14 years 18 days ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
CORR
2008
Springer
14 years 18 days ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
CORR
2008
Springer
14 years 18 days ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...