The following pages link to (Q4359465):
Displaying 15 items.
- Average-case complexity and decision problems in group theory. (Q703812) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Generalized juntas and NP-hard sets (Q837194) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- No NP problems averaging over ranking of distributions are harder (Q1391309) (← links)
- Generic-case complexity, decision problems in group theory, and random walks. (Q1399190) (← links)
- Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
- Complete on average Boolean satisfiability (Q1872642) (← links)
- Computational depth: Concept and applications (Q2368976) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- An efficient local search method for random 3-satisfiability (Q3439117) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
