Reducing computational complexity with array predicates

Proceedings of the APL98 Conference

Volumn , Issue , 1998, Pages 39-43

  Bernecky, Robert ^a  

^a Snake Island Research Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARRAYS; CODES (SYMBOLS); DYNAMIC PROGRAMMING; MEMBERSHIP FUNCTIONS; POLYNOMIALS; VECTORS;

NON-ITERATIVE ALGORITHMS; PRIMITIVES; QUADRATIC TIME;

COMPUTATIONAL COMPLEXITY;

EID: 0032405417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Philip Abrams. An {APL} Machine. PhD thesis, Stanford University, 1970. SLAC Report No. 114.
2. Robert Bernecky. "Speeding up dyadic iota and dyadic epsilon". In APL Congress 73, pages 479-482. North-Holland Publishing Company, 1973. Second printing.
3. Robert Bernecky "Array morphology." In Elena M. Anzalone, editor, APL93 Conference Proceedings, volume 24, pages 6-16, ACM SIGAPL Quote Quad, August 1993.
4. Robert Bernecky. "APEX: The APL parallel executor", Master's thesis, University of Toronto, 1997.
5. Robert Bernecky. "An overview of the APEX compiler", Technical Report 305/97, Department of Computer Science, University of Toronto, 1997.
6. Timothy Budd. An APL Compiler. Springer-Verlag, 1988.
7. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
8. Eric B. Iverson. "APL/4004 implementation". In APL Congress 73, pages 231-236. North-Holland Publishing Company, 1973.
9. Kevin E. Jordan. "Is {APL} really processing arrays?" ACM SIGAPL Quote Quad, 10(1), September 1979.
10. Clark Wiedmann. "Field results with the APL compiler". In APL86 Conference Proceedings, volume 16, pages 187-196. ACM SIGAPL Quote Quad, July 1986.
11. R.G. Willhoft. "Parallel expression in teh {APL2} language." IBM Systems Journal, 30(4), 1991.