Sciweavers

178 search results - page 5 / 36
» Martin's maximum revisited
Sort
View
CP
2006
Springer
15 years 1 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
ICALP
2003
Springer
15 years 2 months ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow
DAM
2008
72views more  DAM 2008»
14 years 9 months ago
Minimization of circuit registers: Retiming revisited
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
Bruno Gaujal, Jean Mairesse
WCE
2007
14 years 10 months ago
A mathematical review of the generalized entropies and their matrix trace inequalities
Abstract– We review the properties of the generalized entropies in our previous papers in the following way. (1)A generalized Fannes’ inequality is shown by the axiomatically c...
Shigeru Furuichi
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert