1322 search results - page 258 / 265 » Unsound Theorem Proving |
CHARME
2001
Springer
13 years 12 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
ANTS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...