Pages that link to "Item:Q92716"
From MaRDI portal
The following pages link to ACM Transactions on Computation Theory (Q92716):
Displaying 50 items.
- (Leveled) fully homomorphic encryption without bootstrapping (Q92720) (← links)
- Exploring the subexponential complexity of completion problems (Q2828210) (← links)
- Quantum XOR games (Q2828211) (← links)
- Input-oblivious proof systems and a uniform complexity perspective on P/poly (Q2828212) (← links)
- On approximate decidability of minimal programs (Q2828213) (← links)
- Characterizing arithmetic read-once formulae (Q2828215) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
- Learning hurdles for sleeping experts (Q2828218) (← links)
- Evolvability of real functions (Q2828219) (← links)
- On the one-way function candidate proposed by Goldreich (Q2828220) (← links)
- The complexity of the comparator circuit value problem (Q2828221) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- The complexity of counting homomorphisms to cactus graphs modulo 2 (Q2828223) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs (Q2828227) (← links)
- Exponential lower bounds for \(\mathrm{AC}^0\)-Frege imply superpolynomial Frege lower bounds (Q2828228) (← links)
- The fine classification of conjunctive queries and parameterized logarithmic space (Q2828230) (← links)
- Pebbling, entropy, and branching program size lower bounds (Q2828231) (← links)
- Hardness of MAX-2Lin and MAX-3Lin over integers, reals, and large cyclic groups (Q2828232) (← links)
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems (Q2828234) (← links)
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps (Q2828236) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- Mutual dimension (Q2832303) (← links)
- Small Depth Proof Systems (Q2849945) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- On Effective Convergence of Numerical Solutions for Differential Equations (Q2943897) (← links)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Algebrization (Q2947539) (← links)
- A Simple Proof of Bazzi’s Theorem (Q2947540) (← links)
- Directed Planar Reachability Is in Unambiguous Log-Space (Q2947541) (← links)
- Hardness of Solving Sparse Overdetermined Linear Systems (Q2947543) (← links)
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545) (← links)
- Formula Caching in DPLL (Q2947546) (← links)
- Cell-Probe Proofs (Q2947548) (← links)
- Lower Bounds for Coin-Weighing Problems (Q2947551) (← links)
- Solvable Group Isomorphism Is (Almost) in NP ∩ coNP (Q2947552) (← links)
- Kolmogorov Complexity in Randomness Extraction (Q2947554) (← links)
- On the Power of Isolation in Planar Graphs (Q2947555) (← links)
- Approximate Query Complexity (Q2947556) (← links)
- Pebbles and Branching Programs for Tree Evaluation (Q2947557) (← links)
- Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length (Q2947559) (← links)
- The Value of Multiple Read/Write Streams for Approximating Frequency Moments (Q2947560) (← links)
- Exact Quantum Algorithms for the Leader Election Problem (Q2947561) (← links)
