Pages that link to "Item:Q2891356"
From MaRDI portal
The following pages link to SOFSEM 2012: Theory and Practice of Computer Science (Q2891356):
Displaying 35 items.
- The Legacy of Turing in Numerical Analysis (Q2891357) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test (Q2891360) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Not Another Look at the Turing Test! (Q2891362) (← links)
- The Equational Theory of Weak Complete Simulation Semantics over BCCSP (Q2891363) (← links)
- Complexity Insights of the Minimum Duplication Problem (Q2891364) (← links)
- A Turing Machine Resisting Isolated Bursts of Faults (Q2891366) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- Randomized Group Testing Both Query-Optimal and Minimal Adaptive (Q2891370) (← links)
- Complexity of Model Checking for Modal Dependence Logic (Q2891371) (← links)
- Multitape NFA: Weak Synchronization of the Input Heads (Q2891372) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Consistent Consequence for Boolean Equation Systems (Q2891375) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- Parikh’s Theorem and Descriptional Complexity (Q2891382) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 (Q2891385) (← links)
- Complete Problem for Perfect Zero-Knowledge Quantum Proof (Q2891386) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Factorization for Component-Interaction Automata (Q2891388) (← links)
- Optimizing Segment Based Document Protection (Q2891390) (← links)
- Securing the Future — An Information Flow Analysis of a Distributed OO Language (Q2891392) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- Cost-Sensitive Classification with Unconstrained Influence Diagrams (Q2891397) (← links)
