Sciweavers

664 search results - page 66 / 133
» Some results for a class of generalized polynomials
Sort
View
ICLP
1994
Springer
15 years 1 months ago
Language Independence and Language Tolerance in Logic Programs
The consequences of a logic program depend in general upon both the rules of the program and its language. However the consequences of some programs are independent of the choice ...
Norman McCain, Hudson Turner
JACM
2000
81views more  JACM 2000»
14 years 9 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
15 years 3 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 10 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
14 years 11 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel