NP-complete decision problems for binary quadratics (Q1243130): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56157366, #quickstatements; #temporary_batch_1704596288873
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Leonard M. Adleman / rank
Normal rank
 
Property / author
 
Property / author: Leonard M. Adleman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(78)90044-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031206336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of diophantine equations I. On the representation of integers by binary forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Riemann's hypothesis and tests for primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:41, 12 June 2024

scientific article
Language Label Description Also known as
English
NP-complete decision problems for binary quadratics
scientific article

    Statements

    Identifiers