The following pages link to (Q4298260):
Displaying 50 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Games for query inseparability of description logic knowledge bases (Q253977) (← links)
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Maximal and supremal tolerances in multiobjective linear programming (Q257229) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- Complexity of model checking for reaction systems (Q264544) (← links)
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- On the data complexity of consistent query answering (Q269317) (← links)
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras (Q278739) (← links)
- Extending propositional dynamic logic for Petri nets (Q281154) (← links)
- Reverse complexity (Q287279) (← links)
- Preferential multi-context systems (Q289006) (← links)
- Reasoning about negligibility and proximity in the set of all hyperreals (Q301366) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- A comment on ``Computational complexity of stochastic programming problems'' (Q312699) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Norm-based mechanism design (Q322076) (← links)
- On \(f\)-reversible processes on graphs (Q324792) (← links)
- Reducing graph coloring to clique search (Q326946) (← links)
- Checking interval properties of computations (Q329413) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- Program equilibrium -- a program reasoning approach (Q361805) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center (Q378186) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Extending inclusion dependencies with conditions (Q386615) (← links)
- On the aggregation problem for synthesized web services (Q389232) (← links)
- A dichotomy in the complexity of counting database repairs (Q389240) (← links)
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- Connectivity games over dynamic networks (Q391110) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Split clique graph complexity (Q393107) (← links)
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (Q393137) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Faster \(p\)-adic feasibility for certain multivariate sparse polynomials (Q412210) (← links)
