UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On the Additive Complexity of Some Integer Sequences

Mathematical Notes, 2024-04, Vol.115 (3-4), p.378-389

Sergeev, I. S.

2024

Volltextzugriff (PDF)

On the Upper Bound of the Complexity of Sorting

Computational mathematics and mathematical physics, 2021-02, Vol.61 (2), p.329-346

Sergeev, I. S.

2021

Volltextzugriff (PDF)

Formula Complexity of a Linear Function in a -ary Basis

Mathematical Notes, 2021, Vol.109 (3-4), p.445-458

Sergeev, I. S.

2021

Volltextzugriff (PDF)

Multilevel Representation and Complexity of Circuits of Unbounded Fan-In Gates

Moscow University mathematics bulletin, 2020-05, Vol.75 (3), p.121-125

Sergeev, I. S.

2020

Volltextzugriff (PDF)

On the Complexity of Fibonacci Coding

Problems of information transmission, 2018-10, Vol.54 (4), p.343-350

Sergeev, I. S.

2018

Volltextzugriff (PDF)

On a Relation Between the Depth and Complexity of Monotone Boolean Formulas

Journal of applied and industrial mathematics, 2019-10, Vol.13 (4), p.746-752

Sergeev, I. S.

2019

Volltextzugriff (PDF)

Polymer/magnetite carriers functionalized by HER2-DARPin: Avoiding lysosomes during internalization and controlled toxicity of doxorubicin by focused ultrasound induced release

Nanomedicine, 2023-01, Vol.47, p.102612, Article 102612

2023

Volltextzugriff (PDF)

The microlearning – from business to education: A promising direction for the development of didactics

Obrazovanie i nauka, 2022-11, Vol.24 (9), p.43-68

2022

Volltextzugriff (PDF)

Rectifier Circuits of Bounded Depth

Journal of applied and industrial mathematics, 2018, Vol.12 (1), p.153-166

Sergeev, I. S.

2018

Volltextzugriff (PDF)

On the real complexity of a complex DFT

Problems of information transmission, 2017-07, Vol.53 (3), p.284-293

Sergeev, I. S.

2017

Volltextzugriff (PDF)

Models of Blended Learning: Organizational and Didactic Typology

Vysšee obrazovanie v Rossii (Print), 2021-06, Vol.30 (5), p.44-64

2021

Volltextzugriff (PDF)

The methods of scenario designing for the development of regional systems of vocational education and training

Obrazovanie i nauka, 2021-02, Vol.23 (2), p.11-38

2021

Volltextzugriff (PDF)

Recognizing of Microseismic Source Types Based on Small-Aperture Seismic Array Data

Izvestiya. Physics of the solid earth, 2020-03, Vol.56 (2), p.260-278

2020

Volltextzugriff (PDF)

Late-quaternary transgression of the White Sea as deduced from data on GIS-Based bottom relief analysis

Geography and natural resources, 2017-07, Vol.38 (3), p.288-294

2017

Volltextzugriff (PDF)

Approximate algorithms for the traveling salesman problem. II

Automation and remote control, 2015-03, Vol.76 (3), p.472-479

Sergeev, S. I.

2015

Volltextzugriff (PDF)

On the additive complexity of GCD and LCM matrices

Mathematical Notes, 2016-07, Vol.100 (1-2), p.199-212

2016

Volltextzugriff (PDF)

Maximum travelling salesman problem. I

Automation and remote control, 2014-12, Vol.75 (12), p.2170-2189

Sergeev, S. I.

2014

Volltextzugriff (PDF)

Identification of Local Seismic Events Using the Mikhnevo Seismic Array

Seismic instruments, 2018-07, Vol.54 (4), p.408-416

2018

Volltextzugriff (PDF)

Management of regional training systems

Obrazovanie i nauka, 2019-04, Vol.21 (3), p.50-76

2019

Volltextzugriff (PDF)

Nonlinear resolving functions for the travelling salesman problem

Automation and remote control, 2013-06, Vol.74 (6), p.978-994

Sergeev, S. I.

2013

Volltextzugriff (PDF)

Formula Complexity of a Linear Function in a $$k$$-ary Basis

Mathematical Notes, 2021-03, Vol.109 (3-4), p.445-458

Sergeev, I. S.

2021

Volltextzugriff (PDF)

On the complexity of the gradient of a rational function

Journal of Applied and Industrial Mathematics, 2008-09, Vol.2 (3), p.385-396

Sergeev, I. S.

2008

Volltextzugriff (PDF)

On the complexity of linear boolean operators with thin matrices

Journal of applied and industrial mathematics, 2011-04, Vol.5 (2), p.202-211

2011

Volltextzugriff (PDF)

“Data-based management”: prospects for implementation into the system of vocational education

Obrazovanie i nauka, 2024-10, Vol.26 (8), p.40-64

2024

Volltextzugriff (PDF)

Complexity and depth of formulas for symmetric Boolean functions

Moscow University mathematics bulletin, 2016-05, Vol.71 (3), p.127-130

Sergeev, I. S.

2016

Volltextzugriff (PDF)

1 – 25 von 12.529

Menü

Weitere Dienste

Einstellungen

On the Additive Complexity of Some Integer Sequences

On the Upper Bound of the Complexity of Sorting

Formula Complexity of a Linear Function in a -ary Basis

Multilevel Representation and Complexity of Circuits of Unbounded Fan-In Gates

On the Complexity of Fibonacci Coding

On a Relation Between the Depth and Complexity of Monotone Boolean Formulas

Polymer/magnetite carriers functionalized by HER2-DARPin: Avoiding lysosomes during internalization and controlled toxicity of doxorubicin by focused ultrasound induced release

The microlearning – from business to education: A promising direction for the development of didactics

Rectifier Circuits of Bounded Depth

On the real complexity of a complex DFT

Models of Blended Learning: Organizational and Didactic Typology

The methods of scenario designing for the development of regional systems of vocational education and training

Recognizing of Microseismic Source Types Based on Small-Aperture Seismic Array Data

Late-quaternary transgression of the White Sea as deduced from data on GIS-Based bottom relief analysis

Approximate algorithms for the traveling salesman problem. II

On the additive complexity of GCD and LCM matrices

Maximum travelling salesman problem. I

Identification of Local Seismic Events Using the Mikhnevo Seismic Array

Management of regional training systems

Nonlinear resolving functions for the travelling salesman problem

Formula Complexity of a Linear Function in a $$k$$-ary Basis

On the complexity of the gradient of a rational function

On the complexity of linear boolean operators with thin matrices

“Data-based management”: prospects for implementation into the system of vocational education

Complexity and depth of formulas for symmetric Boolean functions

Suchergebnisse filtern