Sciweavers

4378 search results - page 38 / 876
» On the Complexity of Ordered Colourings
Sort
View
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Multi-attribute exchange market: representation and indexing of orders
We present an automated exchange for trading complex goods, such as used cars, which allows traders to describe desirable purchases and sales by multiple attributes. The developed...
Eugene Fink, Josh Johnson, John Hershberger 0002
ASPDAC
1995
ACM
66views Hardware» more  ASPDAC 1995»
14 years 12 days ago
Region definition and ordering assignment with the minimization of the number of switchboxes
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
Jin-Tai Yan
DAGSTUHL
2006
13 years 10 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
CAV
2010
Springer
181views Hardware» more  CAV 2010»
14 years 23 days ago
Policy Monitoring in First-Order Temporal Logic
We present an approach to monitoring system policies. As a specification language, we use an expressive fragment of a temporal logic, which can be effectively monitored. We repor...
David A. Basin, Felix Klaedtke, Samuel Müller
CSL
2005
Springer
14 years 2 months ago
The Complexity of Independence-Friendly Fixpoint Logic
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...
Julian C. Bradfield, Stephan Kreutzer