Pages that link to "Item:Q2907481"
From MaRDI portal
The following pages link to Computer Science – Theory and Applications (Q2907481):
Displayed 50 items.
- The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms (Q3007623) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- Snakes and Cellular Automata: Reductions and Inseparability Results (Q3007629) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- Precedence Automata and Languages (Q3007634) (← links)
- Orbits of Linear Maps and Regular Languages (Q3007635) (← links)
- Shared-Memory Systems and Charts (Q3007636) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata (Q3007638) (← links)
- Two-Way Automata versus Logarithmic Space (Q3007639) (← links)
- A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640) (← links)
- Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
- Recent Results on Polynomial Identity Testing (Q3007643) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- The Optimal Strategy for the Average Long-Lived Consensus (Q3007645) (← links)
- Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs (Q3007646) (← links)
- Recognizing Sparse Perfect Elimination Bipartite Graphs (Q3007647) (← links)
- A Multiple-Conclusion Calculus for First-Order Gödel Logic (Q3007648) (← links)
- SZK Proofs for Black-Box Group Problems (Q3434677) (← links)
- Canonical Decomposition of a Regular Factorial Language (Q3434678) (← links)
- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure (Q3434679) (← links)
- Inductive Type Schemas as Functors (Q3434680) (← links)
- Unfolding Synthesis of Asynchronous Automata (Q3434681) (← links)
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers (Q3434682) (← links)
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees (Q3434683) (← links)
- Tuples of Disjoint NP-Sets (Q3434684) (← links)
- Constructive Equivalence Relations on Computable Probability Measures (Q3434685) (← links)
- Planar Dimer Tilings (Q3434686) (← links)
- The Complexity of Equality Constraint Languages (Q3434687) (← links)
- Window Subsequence Problems for Compressed Texts (Q3434688) (← links)
- Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties (Q3434689) (← links)
- Relativisation Provides Natural Separations for Resolution-Based Proof Systems (Q3434690) (← links)
- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems (Q3434691) (← links)
- Isolation and Reducibility Properties and the Collapse Result (Q3434692) (← links)
- Incremental Branching Programs (Q3434693) (← links)
- Logic of Proofs for Bounded Arithmetic (Q3434694) (← links)
- On a Maximal NFA Without Mergible States (Q3434695) (← links)
- Expressiveness of Metric Modalities for Continuous Time (Q3434696) (← links)
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction (Q3434697) (← links)
- Weighted Logics for Traces (Q3434698) (← links)
- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone (Q3434699) (← links)
- Unwinding a Non-effective Cut Elimination Proof (Q3434700) (← links)
- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover (Q3434701) (← links)
- Shannon Entropy vs. Kolmogorov Complexity (Q3434702) (← links)