Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
There Are No Sparse NPw-Hard Sets: There are no sparse NP\(_{w}\)-hard sets |
| Συγγραφείς: |
Dima Grigoriev, Felipe Cucker |
| Πηγή: |
Lecture Notes in Computer Science ISBN: 9783540424963 |
| Στοιχεία εκδότη: |
Springer Berlin Heidelberg, 2001. |
| Έτος έκδοσης: |
2001 |
| Θεματικοί όροι: |
Complexity of computation (including implicit computational complexity), 4. Education, structural complexity, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), real number computations, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences |
| Περιγραφή: |
Summary: We prove that, in the context of weak machines over \(\mathbb R\), there are no sparse NP-hard sets. |
| Τύπος εγγράφου: |
Part of book or chapter of book
Article |
| Περιγραφή αρχείου: |
application/xml |
| ISSN: |
1095-7111
0097-5397 |
| DOI: |
10.1007/3-540-44683-4_25 |
| DOI: |
10.1137/s0097539700379346 |
| Σύνδεσμος πρόσβασης: |
https://epubs.siam.org/doi/pdf/10.1137/S0097539700379346
https://rd.springer.com/chapter/10.1007/3-540-44683-4_25
https://link.springer.com/chapter/10.1007/3-540-44683-4_25
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2001.html#CuckerG01
https://scholars.cityu.edu.hk/en/publications/there-are-no-sparse-npwhard-sets(840a4a17-dd38-4896-bcb6-fc79692ac8f5).html
https://epubs.siam.org/doi/abs/10.1137/S0097539700379346
https://locus.siam.org/doi/abs/10.1137/S0097539700379346
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#CuckerG01 |
| Αριθμός Καταχώρησης: |
edsair.doi.dedup.....074bf1376f0ba878004b6544c8d74e57 |
| Βάση Δεδομένων: |
OpenAIRE |