1225 search results - page 182 / 245 » The Instance Complexity Conjecture |
IAT
2009
IEEE
14 years 1 months ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
CSFW
2004
IEEE
14 years 1 months ago
2004
IEEE
Information flow security properties such as noninterference ensure the protection of confidential data by strongly limiting the flow of sensitive information. However, to deal wi...
ER
2004
Springer
14 years 1 months ago
2004
Springer
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web,...
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
FOCS
2004
IEEE
14 years 1 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...