The following pages link to (Q4393484):
Displaying 50 items.
- Dependence logic with a majority quantifier (Q302214) (← links)
- Collapse of the hierarchy of constant-depth exact quantum circuits (Q347120) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Walking on data words (Q504989) (← links)
- Log-space conjugacy problem in the Grigorchuk group (Q524647) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- On limitations of structured (deterministic) DNNFs (Q778525) (← links)
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Why does deep and cheap learning work so well? (Q1676557) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Seeking computational efficiency boundaries: the Păun's conjecture (Q1982986) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- On the relation between structured \(d\)-DNNFs and SDDs (Q2035477) (← links)
- Monitoring hyperproperties with circuits (Q2165208) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Models of quantum computation and quantum programming languages (Q2250909) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
- Dual VP classes (Q2410687) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- Using the renormalization group to classify Boolean functions (Q2482277) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Partial order games (Q2669153) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Division in logspace-uniform<i>NC</i><sup>1</sup> (Q2773023) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (Q2946409) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
