2446 search results - page 425 / 490 » Choiceless Polynomial Time |
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
CPM
1995
Springer
13 years 11 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
DOOD
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. A simple model for method-based authorization is defined and an algorithm is presented for testing in compile-time whether a given database schema violates authorization...
WEBDB
2000
Springer
13 years 11 months ago
2000
Springer
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...