Pages that link to "Item:Q4286231"
From MaRDI portal
The following pages link to The Complexity of Decision Versus Search (Q4286231):
Displaying 21 items.
- Choice and complexity (Q581191) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- The relative complexity of NP search problems (Q1273858) (← links)
- Quantile and mean value measures of search process complexity (Q1752630) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- The opacity of backbones (Q2051797) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q2223725) (← links)
- Does the polynomial hierarchy collapse if onto functions are invertible? (Q2268347) (← links)
- Upward separations and weaker hypotheses in resource-bounded measure (Q2465636) (← links)
- Many-one reductions and the category of multivalued functions (Q2973252) (← links)
- Complexity of decision problems under incomplete information (Q3975157) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
- Search Problems in the Decision Tree Model (Q4764348) (← links)
- On efficiently solvable cases of quantum \(k\)-SAT (Q5005139) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
- ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM (Q5168412) (← links)
- Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998 (Q5929910) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
- Decision making costs and problem solving performance (Q5959115) (← links)
