Some NP-Hard Problems for the Simultaneous Coprimeness of Values of Linear Polynomials

1
Starchak M.R
Starchak M.R
2
Starchak M.R.
Starchak M.R.
3
Kosovskii N.K.
Kosovskii N.K.
4
Kosovskaya T.M.
Kosovskaya T.M.
1 St. Petersburg State University

Send Message

To: Author

GJCST Volume 17 Issue H4

Article Fingerprint

ReserarchID

CSTITE6KC0

Some NP-Hard Problems for the Simultaneous Coprimeness of Values of Linear Polynomials Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract not found

17 Cites in Articles

References

  1. E Bach,J Shallit (1996). Algorithmic number theory, I: Efficient algorithms.
  2. I Borosh,L Treybig (1976). Bounds on positive integral solutions of linear Diophantine equations.
  3. D Bundala,J Ouaknine (2017). On parametric timed automata and one-counter machines.
  4. L Van Den Dries,A Wilkie (2003). The laws of integer divisibility, and solution sets of linear divisibility conditions.
  5. Michael Fellows,Daniel Lokshtanov,Neeldhara Misra,Frances Rosamond,Saket Saurabh (2008). Graph Layout Problems Parameterized by Vertex Cover.
  6. M Garey,D Johnson (1979). Computers and Intractability: A guide to the theory of NPcompleteness.
  7. Christoph Haase (2014). Subclasses of presburger arithmetic and the weak EXP hierarchy.
  8. N Kosovskii,T Kosovskaya,N Kosovskii (2016). NP-completeness conditions for verifying the consistency of several kinds of systems of linear diophantine discongruences.
  9. N Kosovskii,T Kosovskaya,N Kosovskii (2016). NP-completeness conditions for verifying the consistency of several kinds of systems of linear diophantine dis-equations.
  10. N Kosovskii,T Kosovskaya,N Kosovskii,M Starchak (2017). NP-complete problems for systems of divisibilities of values of linear polynomials.
  11. Antonia Lechner (2015). Synthesis Problems for One-Counter Automata.
  12. Antonia Lechner,Joel Ouaknine,James Worrell (2015). On the Complexity of Linear Arithmetic with Divisibility.
  13. H Lenstra (1983). Integer Programming with a Fixed Number of Variables.
  14. L Lipshitz (1981). Some remarks on the diophantine problem for addition and divisibility.
  15. M Presburger (1929). Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
  16. D Richard (2001). What are weak arithmetics?.
  17. A Woods (1981). Some problems in logic and number theory, and their connections.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Starchak M.R. 2017. \u201cSome NP-Hard Problems for the Simultaneous Coprimeness of Values of Linear Polynomials\u201d. Global Journal of Computer Science and Technology - H: Information & Technology GJCST-H Volume 17 (GJCST Volume 17 Issue H4): .

Download Citation

Issue Cover
GJCST Volume 17 Issue H4
Pg. 21- 25
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-H Classification: G.1.5
Version of record

v1.2

Issue date

December 21, 2017

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 6143
Total Downloads: 1556
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Abstract not found

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Some NP-Hard Problems for the Simultaneous Coprimeness of Values of Linear Polynomials

Starchak M.R.
Starchak M.R.
Kosovskii N.K.
Kosovskii N.K.
Kosovskaya T.M.
Kosovskaya T.M.

Research Journals