- Title
- What can be efficiently reduced to the K-random strings?
- Creators
- Eric ALLENDER - Rutgers University, New Brunswick, NJ, United StatesHarry BUHRMAN - CWI and University of Amsterdam, Amsterdam, NetherlandsMichal KOUCKY - McGill University, Montréal, PQ, Canada
- Publication Details
- Lecture notes in computer science, Vol.2996, pp.584-595
- Conference
- STACS 2004 (Montpellier, 25-27 March 2004)
- Date published
- 2004
- Publisher
- Springer
- Academic Unit
- Computer Science (SAS)
- Language
- English
- Resource Type
- Conference proceeding
- Identifiers
- 991031654942404646
Conference proceeding
What can be efficiently reduced to the K-random strings?
Lecture notes in computer science, Vol.2996, pp.584-595
STACS 2004 (Montpellier, 25-27 March 2004)
2004
Metrics
12 Record Views