Matches in SemOpenAlex for { <https://semopenalex.org/work/W1964410812> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W1964410812 abstract "In this article we show the NP-completeness of some simple number-theoretic problems. Natural simplifications of these problems invariably are known to be in P. Our research was motivated by the question whether one could study non-deterministic computation without loss of generality on a restricted, number theoretically significant class of nondeterministic Turing machines, the nondeterministic diophantine machines defined below [1,2]. The results suggest this is true.Because of the relative difficulty of the reduction of the satisfiability problem used in the proof, and the distinctly number-theoretic character of the problems shown to be NP-complete, we hope that the NP-completeness of these problems will play a role in showing the NP-completeness of further problems of a numerical nature, much as the satisfiability problem has in showing the NP-completeness of combinatorial problems ([3],[5]).The results illustrate an intimate connection between problems in computational theory, such as “P=NP?”, and problems in number theory, e.g. about quadratic congruences in one unknown, which are just beyond the range in which efficient algorithms exist. Thus our work exposes an interface between the state-of-the-art in number theory and in the theory of computation. Also, our results can be seen as the solution to a natural and important revision of Hilbert's 10thproblem: Give a feasible algorithmic procedure to decide whether an arbitrary diophantine equation has solutions. Unless P=NP this is impossible, even for a class of quadratic diophantine equations in two unknowns for which a decision procedure in the original sense is in fact available. Certainly, these results present a striking rigorous demonstration that number theorists' intuitions about where problems about diophantine equations and quadratic congruences start to be truly difficult are justified." @default.
- W1964410812 created "2016-06-24" @default.
- W1964410812 creator A5048720314 @default.
- W1964410812 creator A5076478379 @default.
- W1964410812 date "1976-01-01" @default.
- W1964410812 modified "2023-10-16" @default.
- W1964410812 title "NP-complete decision problems for quadratic polynomials" @default.
- W1964410812 cites W1522991784 @default.
- W1964410812 cites W1590838337 @default.
- W1964410812 cites W1989073291 @default.
- W1964410812 cites W2036265926 @default.
- W1964410812 cites W2052936500 @default.
- W1964410812 cites W2057182494 @default.
- W1964410812 cites W2071056578 @default.
- W1964410812 cites W2401610261 @default.
- W1964410812 doi "https://doi.org/10.1145/800113.803627" @default.
- W1964410812 hasPublicationYear "1976" @default.
- W1964410812 type Work @default.
- W1964410812 sameAs 1964410812 @default.
- W1964410812 citedByCount "32" @default.
- W1964410812 countsByYear W19644108122012 @default.
- W1964410812 countsByYear W19644108122013 @default.
- W1964410812 countsByYear W19644108122015 @default.
- W1964410812 countsByYear W19644108122016 @default.
- W1964410812 countsByYear W19644108122017 @default.
- W1964410812 countsByYear W19644108122018 @default.
- W1964410812 countsByYear W19644108122023 @default.
- W1964410812 crossrefType "proceedings-article" @default.
- W1964410812 hasAuthorship W1964410812A5048720314 @default.
- W1964410812 hasAuthorship W1964410812A5076478379 @default.
- W1964410812 hasConcept C126255220 @default.
- W1964410812 hasConcept C129844170 @default.
- W1964410812 hasConcept C2524010 @default.
- W1964410812 hasConcept C28826006 @default.
- W1964410812 hasConcept C33923547 @default.
- W1964410812 hasConcept C41008148 @default.
- W1964410812 hasConceptScore W1964410812C126255220 @default.
- W1964410812 hasConceptScore W1964410812C129844170 @default.
- W1964410812 hasConceptScore W1964410812C2524010 @default.
- W1964410812 hasConceptScore W1964410812C28826006 @default.
- W1964410812 hasConceptScore W1964410812C33923547 @default.
- W1964410812 hasConceptScore W1964410812C41008148 @default.
- W1964410812 hasLocation W19644108121 @default.
- W1964410812 hasOpenAccess W1964410812 @default.
- W1964410812 hasPrimaryLocation W19644108121 @default.
- W1964410812 hasRelatedWork W1897792427 @default.
- W1964410812 hasRelatedWork W1977258303 @default.
- W1964410812 hasRelatedWork W2014153293 @default.
- W1964410812 hasRelatedWork W2019904890 @default.
- W1964410812 hasRelatedWork W2060032448 @default.
- W1964410812 hasRelatedWork W2067807858 @default.
- W1964410812 hasRelatedWork W2320139629 @default.
- W1964410812 hasRelatedWork W3021793061 @default.
- W1964410812 hasRelatedWork W4295066108 @default.
- W1964410812 hasRelatedWork W2078733341 @default.
- W1964410812 isParatext "false" @default.
- W1964410812 isRetracted "false" @default.
- W1964410812 magId "1964410812" @default.
- W1964410812 workType "article" @default.