Sciweavers

1670 search results - page 137 / 334
» On Skolemization in constructive theories
Sort
View
ASIACRYPT
2008
Springer
15 years 8 months ago
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
CAV
2008
Springer
143views Hardware» more  CAV 2008»
15 years 8 months ago
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
Salil Joshi, Barbara König
CDC
2008
IEEE
291views Control Systems» more  CDC 2008»
15 years 8 months ago
Structured semidefinite representation of some convex sets
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
J. William Helton, Jiawang Nie
MKWI
2008
133views Business» more  MKWI 2008»
15 years 8 months ago
Reference Modelling of the Financial Reporting Supply Chain Architecture
: The domain of business reporting and especially financial reporting plays an important role when discussing internal and external information flows among organizational units. Th...
Maciej Piechocki, Carsten Felden
IPCO
2007
81views Optimization» more  IPCO 2007»
15 years 8 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...