The following pages link to Guillaume Bonfante (Q276255):
Displaying 27 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- (Q541225) (redirect page) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Real or natural number interpretation and their effect on complexity (Q2346989) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- Intensional Properties of Polygraphs (Q2870314) (← links)
- Immune Systems in Computer Virology (Q3195689) (← links)
- (Q3388522) (← links)
- Quasi-interpretation Synthesis by Decomposition (Q3525100) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- Complexity Invariance of Real Interpretations (Q3569071) (← links)
- Towards an Implicit Characterization of NC k (Q3613339) (← links)
- Some Programming Languages for Logspace and Ptime (Q3623925) (← links)
- Polygraphic programs and polynomial-time functions (Q3636813) (← links)
- (Q4263809) (← links)
- (Q4475109) (← links)
- Non-size increasing graph rewriting for natural language processing (Q4585012) (← links)
- The genus of regular languages (Q4599611) (← links)
- Stochastic Lambek Categorial Grammars (Q4923553) (← links)
- Characterising Space Complexity Classes via Knuth-Bendix Orders (Q4933302) (← links)
- Decidability of regular language genus computation (Q5108538) (← links)
- A Characterization of Alternating Log Time by First Order Functional Programs (Q5387886) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395130) (← links)
- A Classification of Viruses Through Recursion Theorems (Q5426867) (← links)
- Term Rewriting and Applications (Q5703845) (← links)
- Lexical Disambiguation with Polarities and Automata (Q5757241) (← links)
- The genus of regular languages and directed graph emulators (Q6495791) (← links)
