The following pages link to Bounded Query Classes (Q3495646):
Displaying 50 items.
- Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222) (← links)
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- Norm-based mechanism design (Q322076) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- On the equivalence of distributed systems with queries and communication (Q389221) (← links)
- Updating action domain descriptions (Q622109) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- The complexity of Kemeny elections (Q817813) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- \(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP (Q908700) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Bounded queries to SAT and the Boolean hierarchy (Q1178690) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- A note on unambiguous function classes (Q1607022) (← links)
- Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty (Q1677438) (← links)
- An extension-based approach to belief revision in abstract argumentation (Q1726407) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Propositional default logics made easier: computational complexity of model checking. (Q1853549) (← links)
- Commutative queries (Q1854422) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Combining experts' causal judgments (Q2046003) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Choice logics and their computational properties (Q2082503) (← links)
- Complexity of stability (Q2237893) (← links)
- Complexity-theoretic aspects of expanding cellular automata (Q2278565) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
