Pages that link to "Item:Q673784"
From MaRDI portal
The following pages link to Computing functions with parallel queries to NP (Q673784):
Displayed 11 items.
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)
- UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS (Q4528761) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)