AbstractThe complexity of the equivalence problem for several classes of simple programs with a fixed number of program variables is investigated. The classes are shown to have undecidable, NP-hard, or polynomial-time decidable equivalence problems
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
P versus NP is one of the most important and unsolved problems in computer science. This consists on...
AbstractLet E be the set of all simple arithmetic expressions of the form E(x) = xTl…Tk where x is a...
Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial t...
AbstractWe explore the natural question of whether all NP-complete problems have a common restrictio...
Abstract. The article summarizes the results of the author in the area of automated verification of ...
AbstractThe complexity of the zero-inequivalence problem (deciding if a program outputs a nonzero va...
In this master thesis the hierarchy of automata and related languages is presented. First, the conce...
The equivalence problem for deterministic context-free languages is shown to be decidable if and onl...
AbstractSeveral observations are presented on the computational complexity of regular expression pro...
P versus NP is considered as one of the most important open problems in computer science. This consi...
We survey two aspects of mixed-integer nonlinear programming which have attracted less attention (so...
In this paper, we examine a recently introduced type of effective reduction which applies solely to ...
Abstract. We consider the extent to which it's possible, given 8 program p for computing a func...
AbstractWe show that any recursive sequence of recursive sets which is ascending with respect to the...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
P versus NP is one of the most important and unsolved problems in computer science. This consists on...
AbstractLet E be the set of all simple arithmetic expressions of the form E(x) = xTl…Tk where x is a...
Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial t...
AbstractWe explore the natural question of whether all NP-complete problems have a common restrictio...
Abstract. The article summarizes the results of the author in the area of automated verification of ...
AbstractThe complexity of the zero-inequivalence problem (deciding if a program outputs a nonzero va...
In this master thesis the hierarchy of automata and related languages is presented. First, the conce...
The equivalence problem for deterministic context-free languages is shown to be decidable if and onl...
AbstractSeveral observations are presented on the computational complexity of regular expression pro...
P versus NP is considered as one of the most important open problems in computer science. This consi...
We survey two aspects of mixed-integer nonlinear programming which have attracted less attention (so...
In this paper, we examine a recently introduced type of effective reduction which applies solely to ...
Abstract. We consider the extent to which it's possible, given 8 program p for computing a func...
AbstractWe show that any recursive sequence of recursive sets which is ascending with respect to the...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
P versus NP is one of the most important and unsolved problems in computer science. This consists on...
AbstractLet E be the set of all simple arithmetic expressions of the form E(x) = xTl…Tk where x is a...
DOI
Add to ORKG