Sciweavers

6142 search results - page 218 / 1229
» The Complexity of Partition Functions
Sort
View
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
15 years 6 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
IM
2007
15 years 6 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
TIT
2008
51views more  TIT 2008»
15 years 6 months ago
Spectral Relations for Multidimensional Complex Improper Stationary and (Almost) Cyclostationary Processes
Abstract--We study continuous-time multidimensional widesense stationary (WSS) and (almost) cyclostationary processes in the frequency domain. Under the assumption that the correla...
Patrik Wahlberg, Peter J. Schreier
AMC
2011
15 years 1 months ago
Complexity reduction of C-Algorithm
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
Magali Bardet, Islam Boussaada
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
15 years 8 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco