The fault tolerance of NP-hard problems (Q553311): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2010.11.012
@@ Property / DOI: 10.1016/j.ic.2010.11.012 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5932324
@@ Property / zbMATH DE Number: 5932324 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+faulty data
@@ Property / zbMATH Keywords: faulty data / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-hard sets
@@ Property / zbMATH Keywords: NP-hard sets / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+left-set technique
@@ Property / zbMATH Keywords: left-set technique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+m-complete sets
@@ Property / zbMATH Keywords: m-complete sets / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+btt-complete sets
@@ Property / zbMATH Keywords: btt-complete sets / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+self-correctable
@@ Property / zbMATH Keywords: self-correctable / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+p-closeness
@@ Property / zbMATH Keywords: p-closeness / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2010.11.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2654659232
@@ Property / OpenAlex ID: W2654659232 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
+Normal rank
@@ Property / cites work @@
+On lower bounds of the closeness between complexity classes
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Redundancy in Complete Sets
@@ Property / cites work: Redundancy in Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
+Normal rank
@@ Property / cites work @@
+A Note on Sparse Complete Sets
@@ Property / cites work: A Note on Sparse Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse hard sets for counting classes
@@ Property / cites work: On sparse hard sets for counting classes / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets and closeness to complexity classes
@@ Property / cites work: Complete sets and closeness to complexity classes / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2010.11.012
@@ Property / DOI: 10.1016/J.IC.2010.11.012 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:553311