Sciweavers

523 search results - page 25 / 105
» On the Power of Quantum Proofs
Sort
View
EJC
2007
15 years 1 months ago
On the number of Tverberg partitions in the prime power case
We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the p...
Stephan Hell
FASE
2000
Springer
15 years 5 months ago
Verification of Object Oriented Programs Using Class Invariants
A proof system is presented for the verification and derivation of object oriented programs with as main features strong typing, dynamic binding, and inheritance. The proof system...
Kees Huizing, Ruurd Kuiper
JC
2007
94views more  JC 2007»
15 years 1 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
RTA
2004
Springer
15 years 7 months ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...