Pages that link to "Item:Q107189"
From MaRDI portal
The following pages link to Journal of Computer and System Sciences (Q107189):
Displaying 50 items.
- Tractability frontiers of the partner units configuration problem (Q269477) (← links)
- Capturing model-based ontology evolution at the instance level: the case of DL-Lite (Q389229) (← links)
- Algorithms for a distributed IDS in MANETs (Q389376) (← links)
- Denials leak information: simulatable auditing (Q394747) (← links)
- Mixing local and global information for community detection in large networks (Q394992) (← links)
- Search methods for tile sets in patterned DNA self-assembly (Q395021) (← links)
- Markov network based ontology matching (Q414853) (← links)
- A spectral algorithm for learning hidden Markov models (Q439990) (← links)
- The \(K\)-armed dueling bandits problem (Q440003) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Normality and automata (Q494059) (← links)
- On the finite controllability of conjunctive query answering in databases under open-world assumption (Q532372) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- A bridging model for multi-core computing (Q619912) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Combined-semantics equivalence of conjunctive queries: decidability and tractability results (Q899579) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- On predictive accuracy and risk minimization in pairwise label ranking (Q1049275) (← links)
- Sylow's theorem in polynomial time (Q1063109) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- Solvability by radicals is in polynomial time (Q1071803) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- How easy is local search? (Q1109573) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- Tree constructions of free continuous algebras (Q1160149) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Analysis of structured programs (Q1212350) (← links)
- A geometric hierarchy of languages (Q1212799) (← links)
- Comment on the paper 'Error detection in formal languages' (Q1212800) (← links)
- Fault tolerant cellular spaces (Q1223067) (← links)
- On reversibility in cellular automata (Q1226471) (← links)
- Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
- Riemann's hypothesis and tests for primality (Q1235011) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. II (Q1240565) (← links)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- Reversibility and surjectivity problems of cellular automata (Q1318474) (← links)
- Finding level-ancestors in trees (Q1329158) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Hardness vs randomness (Q1337458) (← links)
