>
Fa
|
Ar
|
En
journal of universal computer science
سال:2010 - دوره:16 - شماره:18
A Constructive Study of Landau's Summability Theorem
- صفحه:2523-2534
A Note on Closed Subsets in Quasi-zero-dimensional Qcb-spaces
- صفحه:2711-2732
Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions
- صفحه:2496-2522
Compositional Semantics of Dataflow Networks with Query-Driven Communication of Exact Values
- صفحه:2629-2656
Computability and Complexity in Analysis
- صفحه:2495-2495
Computable Separation in Topology, from T0 to T2
- صفحه:2733-2753
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
- صفحه:2657-2685
How Incomputable is Finding Nash Equilibria?
- صفحه:2686-2710
Isometries and Computability Structures
- صفحه:2569-2596
On Choice Principles and Fan Theorems
- صفحه:2556-2562
Realisability for Induction and Coinduction with Applications to Constructive Analysis
- صفحه:2535-2555
Semantics of Query-Driven Communication of Exact Values
- صفحه:2597-2628
The Separation of Relativized Versions of P and DNP for the Ring of the Reals
- صفحه:2563-2568
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
