Pages that link to "Item:Q3392935"
From MaRDI portal
The following pages link to Computer Science - Theory and Applications (Q3392935):
Displayed 50 items.
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Well-Founded and Partial Stable Semantics Logical Aspects (Q3392936) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Kolmogorov Complexity and Model Selection (Q3392938) (← links)
- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism (Q3392939) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes (Q3392941) (← links)
- k-SAT Is No Harder Than Decision-Unique-k-SAT (Q3392942) (← links)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations (Q3392943) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- A Feebly Secure Trapdoor Function (Q3392948) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- Structural Complexity of AvgBPP (Q3392950) (← links)
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials (Q3392951) (← links)
- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- Approximability of the Maximum Solution Problem for Certain Families of Algebras (Q3392956) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products (Q3392958) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Aperiodicity Measure for Infinite Sequences (Q3392963) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- Breaking Anonymity by Learning a Unique Minimum Hitting Set (Q3392966) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- Finding All Solutions of Equations in Free Groups and Monoids with Involution (Q4981143) (← links)
- Algorithmic Meta Theorems for Sparse Graph Classes (Q4981144) (← links)
- The Lattice of Definability. Origins, Recent Developments, and Further Directions (Q4981145) (← links)
- Counting Popular Matchings in House Allocation Problems (Q4981147) (← links)
- Vertex Disjoint Paths in Upward Planar Graphs (Q4981149) (← links)
- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains (Q4981150) (← links)
- Testing Low Degree Trigonometric Polynomials (Q4981151) (← links)
- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees (Q4981152) (← links)
- A Fast Branching Algorithm for Cluster Vertex Deletion (Q4981153) (← links)
- Separation Logic with One Quantified Variable (Q4981154) (← links)
- QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average (Q4981155) (← links)
- Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results (Q4981156) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- Block Products and Nesting Negations in FO2 (Q4981158) (← links)
- Model Checking for String Problems (Q4981159) (← links)
- Semiautomatic Structures (Q4981160) (← links)
- The Query Complexity of Witness Finding (Q4981161) (← links)
- Primal Implication as Encryption (Q4981162) (← links)