Sciweavers

1380 search results - page 146 / 276
» A General Polynomial Sieve
Sort
View
FOCS
1998
IEEE
14 years 1 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
SAC
1997
ACM
14 years 1 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn
ICLP
1997
Springer
14 years 1 months ago
Total Homeostaticity and Integrity Constraints Restorability Recognition
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
Michael I. Dekhtyar, Alexander Ja. Dikovsky
CAAP
1992
14 years 1 months ago
Varieties of Increasing Trees
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
François Bergeron, Philippe Flajolet, Bruno...
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 26 days ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka