Sciweavers

425 search results - page 64 / 85
» The TPS Theorem Proving System
Sort
View
COMPUTING
2007
101views more  COMPUTING 2007»
14 years 9 months ago
Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests
The Krawczyk and the Hansen-Sengupta interval operators are closely related to the interval Newton operator. These interval operators can be used as existence tests to prove exist...
Alexandre Goldsztejn
SIAMDM
2008
97views more  SIAMDM 2008»
14 years 9 months ago
Disjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
Raphael Yuster
72
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 8 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
Salman Beigi, Peter W. Shor, John Watrous
CADE
2007
Springer
15 years 10 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ECOOP
1998
Springer
15 years 1 months ago
A Study of The Fragile Base Class Problem
In this paper we study the fragile base class problem. This problem occurs in open object-oriented systems employing code inheritance as an implementation reuse mechanism. System d...
Leonid Mikhajlov, Emil Sekerinski