We completely classify the relative expressibilities of the program schemes of NPS augmented with the built-in relations: linear order; addition; multiplication; and BIT. We employ pebble games allied with some number theory
A system of Prolog based programs for the purpose of approximating the rank of algebraic operations ...
International audienceCoinductive reasoning in terms of bisimulations is in practice routinely suppo...
This paper reports a case study in the use of proof planning in the context of higher order syntax. ...
We begin by proving that the class of problems accepted by the program schemes of NPS is exactly the...
We characterize the class of problems accepted by a class of program schemes with arrays, NPSA, as t...
We continue the study of the expressive power of certain classes of program schemes on finite struct...
We study a class of program schemes, NPSB, in which, aside from basic assignments, non-deterministic...
RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of pe...
AbstractProblem statements often resort to superlatives such as in e.g. “… the smallest such number”...
Problem statements often resort to superlatives such as in e.g. “… the smallest such number”, “… the...
AbstractElementary computations over relational structures give rise to computable relations definab...
Inspired by computational complexity results for the quantified constraint satisfaction problem, we ...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
AbstractIt is shown that the assumption of NP having polynomial-size circuits implies (apart from a ...
An equality language is a relational structure with infinite domain whose relations are first-order ...
A system of Prolog based programs for the purpose of approximating the rank of algebraic operations ...
International audienceCoinductive reasoning in terms of bisimulations is in practice routinely suppo...
This paper reports a case study in the use of proof planning in the context of higher order syntax. ...
We begin by proving that the class of problems accepted by the program schemes of NPS is exactly the...
We characterize the class of problems accepted by a class of program schemes with arrays, NPSA, as t...
We continue the study of the expressive power of certain classes of program schemes on finite struct...
We study a class of program schemes, NPSB, in which, aside from basic assignments, non-deterministic...
RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of pe...
AbstractProblem statements often resort to superlatives such as in e.g. “… the smallest such number”...
Problem statements often resort to superlatives such as in e.g. “… the smallest such number”, “… the...
AbstractElementary computations over relational structures give rise to computable relations definab...
Inspired by computational complexity results for the quantified constraint satisfaction problem, we ...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
AbstractIt is shown that the assumption of NP having polynomial-size circuits implies (apart from a ...
An equality language is a relational structure with infinite domain whose relations are first-order ...
A system of Prolog based programs for the purpose of approximating the rank of algebraic operations ...
International audienceCoinductive reasoning in terms of bisimulations is in practice routinely suppo...
This paper reports a case study in the use of proof planning in the context of higher order syntax. ...
DOI
Add to ORKG