Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446): Difference between revisions

@@ Property / author @@
+Pierluigi Crescenzi
@@ Property / author: Pierluigi Crescenzi / rank @@
+Normal rank
@@ Property / author @@
+Riccardo Silvestri
@@ Property / author: Riccardo Silvestri / 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/0020-0190(90)90188-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2060079637
@@ Property / OpenAlex ID: W2060079637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3747725
@@ Property / cites work: Q3747725 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems over power sets
@@ Property / cites work: Combinatorial problems over power sets / rank @@
+Normal rank
@@ Property / cites work @@
+Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
+Normal rank
@@ Property / cites work @@
+Q4249726
@@ Property / cites work: Q4249726 / rank @@
+Normal rank
@@ Property / cites work @@
+On gamma-reducibility versus polynomial time many-one reducibility
+Normal rank
@@ Property / cites work @@
+Complexity of Presburger arithmetic with fixed quantifier dimension
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank