Pages that link to "Item:Q4337437"

The following pages link to Finite Monoids: From Word to Circuit Evaluation (Q4337437):

Displaying 25 items.

• Linear circuits, two-variable logic and weakly blocked monoids (Q391307) (← links)
• Leaf languages and string compression (Q550251) (← links)
• Computations over finite monoids and their test complexity (Q1178692) (← links)
• The complexity of iterated multiplication (Q1346717) (← links)
• Circuits and expressions with nonassociative gates (Q1567406) (← links)
• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• Circuits, matrices, and nonassociative computation (Q1894452) (← links)
• Better complexity bounds for cost register automata (Q1999991) (← links)
• Compression techniques in group theory (Q2117795) (← links)
• The complexity of compressed membership problems for finite automata (Q2254509) (← links)
• A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
• Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
• Evaluating Matrix Circuits (Q3196387) (← links)
• Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids (Q3525564) (← links)
• Circuit evaluation for finite semirings (Q4636634) (← links)
• Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria (Q5055938) (← links)
• (Q5090487) (← links)
• (Q5092405) (← links)
• (Q5092480) (← links)
• Better complexity bounds for cost register automata (Q5111238) (← links)
• Space Complexity of Reachability Testing in Labelled Graphs (Q5739010) (← links)
• Integer circuit evaluation is PSPACE-complete (Q5956016) (← links)
• The power word problem in graph products (Q6580077) (← links)
• Compressed decision problems in hyperbolic groups (Q6619327) (← links)