Sciweavers

2693 search results - page 9 / 539
» On Computing Complex Navigation Functions
Sort
View
CIE
2006
Springer
15 years 10 months ago
Logspace Complexity of Functions and Structures
Douglas Cenzer, Zia Uddin
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud