The following pages link to (Q4298260):
Displayed 50 items.
- Multi-parameterised compositional verification of safety properties (Q498394) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- The tabularity problem over the minimal logic (Q515492) (← links)
- From imperative to rule-based graph programs (Q516038) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Queries and materialized views on probabilistic databases (Q532366) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Boolean logics with relations (Q604451) (← links)
- Reexamination of an information geometric construction of entropic indicators of complexity (Q613216) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- More on the Magnus-Derek game (Q620945) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Updating action domain descriptions (Q622109) (← links)
- Outlier detection for simple default theories (Q622112) (← links)
- The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields (Q633725) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
- The computational complexity of weak saddles (Q647484) (← links)
- Estimating sample mean under interval uncertainty and constraint on sample variance (Q648375) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Groves of phylogenetic trees (Q659789) (← links)
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- Holographic subregion complexity from kinematic space (Q667049) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Connectivity with directional antennas in the symmetric communication model (Q679737) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- The navigational power of web browsers (Q692917) (← links)