Isabel Oitavem - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2025

Numeral completeness of weak theories of arithmeticReinhard Kahle, Isabel Oitavem, Paulo Guilherme Santos. logcom, 35(1):172-193, 2025. [doi]

2024

Enumerating Error Bounded Polytime Algorithms Through Arithmetical TheoriesMelissa Antonelli, Ugo Dal Lago, Davide Davoli, Isabel Oitavem, Paolo Pistone. csl 2024: [doi]

2022

Implicit recursion-theoretic characterizations of counting classesUgo Dal Lago, Reinhard Kahle, Isabel Oitavem. AML, 61(7-8):1129-1144, 2022. [doi]

The polynomial hierarchy of functions and its levelsIsabel Oitavem. TCS, 900:25-34, 2022. [doi]

2021

A Recursion-Theoretic Characterization of the Probabilistic Class PPUgo Dal Lago, Reinhard Kahle, Isabel Oitavem. mfcs 2021: [doi]

2018

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time FunctionsAnupam Das 0002, Isabel Oitavem. csl 2018: [doi]

2016

k boolean circuitsGuillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. iandc, 248:82-103, 2016. [doi]

2013

Applicative theories for the polynomial hierarchy of time and its levelsReinhard Kahle, Isabel Oitavem. APAL, 164(6):663-675, 2013. [doi]

From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)Isabel Oitavem. csl 2013: 24-27 [doi]

2012

Monotonicity Constraints in Characterizations of PSPACEAmir M. Ben-Amram, Bruno Loff, Isabel Oitavem. logcom, 22(2):179-195, 2012. [doi]

2011

A recursion-theoretic approach to NPIsabel Oitavem. APAL, 162(8):661-666, 2011. [doi]

2008

Recursion Schemata for NCkGuillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. csl 2008: 49-63 [doi]

Characterizing PSPACE with pointersIsabel Oitavem. mlq, 54(3):323-329, 2008. [doi]

2006

Towards an Implicit Characterization of ::::NC:::::::::::k:::::::Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. csl 2006: 212-224 [doi]

2004

Separating ::::NC:::: along the delta axisS. Bellantoni, Isabel Oitavem. TCS, 318(1-2):57-78, 2004. [doi]

Characterizing ::::NC:::: with tier 0 pointersIsabel Oitavem. mlq, 50(1):9-17, 2004. [doi]

2002

A term rewriting characterization of the functions computable in polynomial spaceIsabel Oitavem. AML, 41(1):35-47, 2002. [doi]

2001

Implicit Characterizations of PspaceIsabel Oitavem. Dagstuhl 2001: 170-190 [doi]

Sign in or sign up to see more results.

runs on WebDSL