Sciweavers

45 search results - page 9 / 9
» Congruence of (2
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
13 years 9 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
ICALP
2007
Springer
13 years 11 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
ACMSE
2007
ACM
13 years 9 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
UIST
1997
ACM
13 years 8 months ago
Interactive Beautification: A Technique for Rapid Geometric Design
We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus. The motivation is to ...
Takeo Igarashi, Satoshi Matsuoka, Sachiko Kawachiy...
IANDC
2010
141views more  IANDC 2010»
13 years 3 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner