The following pages link to Victor L. Selivanov (Q949620):
Displaying 50 items.
- (Q306281) (redirect page) (← links)
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Fine hierarchies via Priestley duality (Q424549) (← links)
- (Q583198) (redirect page) (← links)
- Application of precomplete enumerations to tabular-type degrees and index sets (Q583199) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- Definability of closure operations in the \(h\)-quasiorder of labeled forests (Q619316) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Hierarchies of hyperarithmetical sets and functions (Q799667) (← links)
- Primitive recursive ordered fields and some applications (Q831997) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Arithmetic hierarchy and ideals of enumerated Boolean algebras (Q922530) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Wadge reducibility and infinite computations (Q1001344) (← links)
- Definability in the \(h\)-quasiorder of labeled forests (Q1023296) (← links)
- On the Wadge reducibility of \(k\)-partitions (Q1044675) (← links)
- Structure of degrees of generalized index sets (Q1062048) (← links)
- Index sets in the hyperarithmetical hierarchy (Q1068818) (← links)
- Ershov hierarchy (Q1074576) (← links)
- Hierarchy of limiting computations (Q1078173) (← links)
- Automorphism groups of numbered sets (Q1099169) (← links)
- Ershov hierarchy and the T-jump (Q1120565) (← links)
- Algorithmic complexity of algebraic systems (Q1121875) (← links)
- Fine hierarchy of regular \(\omega\)-languages (Q1127312) (← links)
- Structures of the degrees of unsolvability of index sets (Q1150612) (← links)
- Index sets of classes of hyper-hypersimple sets (Q1174056) (← links)
- Enumerations of families of general recursive functions (Q1239156) (← links)
- Two theorems on computable numberings (Q1242907) (← links)
- Enumerations of canonically calculable families of finite sets (Q1258301) (← links)
- Some remarks about classes of recursively enumerable sets (Q1258731) (← links)
- Index sets of quotient objects of the Post numeration (Q1263578) (← links)
- Jumps of certain classes of \(\Delta_ 2^ 0\)-sets (Q1308616) (← links)
- Polynomial-time presentations of algebraic number fields (Q1670714) (← links)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract) (Q1670767) (← links)
- On constructive number fields and computability of solutions of PDEs (Q1707150) (← links)
- Turing degrees in refinements of the arithmetical hierarchy (Q1757652) (← links)
- Refined hierarchy of formulas (Q1803026) (← links)
- On recursively enumerable structures (Q1919770) (← links)
- Polynomial computability of fields of algebraic numbers (Q1994088) (← links)
- Extending Wadge theory to \(k\)-partitions (Q2011677) (← links)
- Precomplete numberings (Q2036469) (← links)
- Classifying \(\omega\)-regular aperiodic \(k\)-partitions (Q2040422) (← links)
- Complexity issues for the iterated \(h\)-preorders (Q2096579) (← links)
- Enumerating classes of effective quasi-Polish spaces (Q2104255) (← links)
- Boole vs Wadge: comparing two basic tools of descriptive set theory (Q2104278) (← links)
- Degrees of non-computability of homeomorphism types of Polish spaces (Q2106604) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Non-collapse of the effective wadge hierarchy (Q2117803) (← links)
