When does a polynomial over a finite field permute the elements of the fields?
American Mathematical Monthly
The computational complexity of recognizing permutation functions
Computational Complexity
IBM Systems Journal
Watermarking of uncompressed and compressed video
Signal Processing
Solvability of systems of polynomial congruences modulo a large prime
Computational Complexity
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Natural Language Watermarking and Tamperproofing
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Watermarking relational data: framework, algorithms and analysis
The VLDB Journal — The International Journal on Very Large Data Bases
Proving Ownership over Categorical Data
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Rights Protection for Relational Data
IEEE Transactions on Knowledge and Data Engineering
Resilient rights protection for sensor streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Digital Watermarks for Audio Signals
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation
IH'04 Proceedings of the 6th international conference on Information Hiding
Soft IP protection: watermarking HDL codes
IH'04 Proceedings of the 6th international conference on Information Hiding
Effective approaches for watermarking XML data
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
A fractal watermark solution for product data
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
| Hi-index | 0.00 |
We investigate the complexity of the following polynomial solvability problem: Given a finite field ${\mathbb F}_{q}$ and a set of polynomials $$f_{1}(x,y),f_{2}(x,y),...,f_{n}(x,y),g(x,y) \ \epsilon \ {\mathbb F}_{q} [x,y]$$ determine the ${\mathbb F}_{q}$-solvability of the system $$f_{1}(x,y)=f_{2}(x,y)=...=f_{n}(x,y)=0 \ {\rm and} \ {\it g}(x,y) \neq 0$$ We give a deterministic polynomial-time algorithm for this problem.