Sciweavers

32 search results - page 3 / 7
» Algorithm 786: Multiple-Precision Complex Arithmetic and Fun...
Sort
View
ESOP
2007
Springer
15 years 3 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
APAL
2004
105views more  APAL 2004»
14 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
MST
2007
168views more  MST 2007»
14 years 9 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
15 years 1 months ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
15 years 1 months ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson