Pages that link to "Item:Q673784"
From MaRDI portal
The following pages link to Computing functions with parallel queries to NP (Q673784):
Displaying 18 items.
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- 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)
- Complexity of counting the optimal solutions (Q837174) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Combining experts' causal judgments (Q2046003) (← links)
- Expressive probabilistic description logics (Q2389639) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Graph Isomorphism is in SPP (Q2495656) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
- Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
- The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
- Semiring reasoning frameworks in AI and their computational complexity (Q6488781) (← links)
