Sciweavers

4397 search results - page 359 / 880
» Relational Algebra Operations
Sort
View
CP
2006
Springer
15 years 8 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 8 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
FLOPS
2006
Springer
15 years 8 months ago
"Scrap Your Boilerplate" Reloaded
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
Ralf Hinze, Andres Löh, Bruno C. D. S. Olivei...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
15 years 8 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
TPHOL
2000
IEEE
15 years 8 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg