Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
полиномиальный
Связанные издания:
Algorithms and Complexity: Proc./11th International Conference, CIAC 2019, Roma, Italy, May 2019
Algorithms and Computation: Proc./23th International Symposium, ISAAC 2012, Taipei, Taiwan, December 2012
Algorithms and Computation: Proc./24th International Symposium, ISAAC 2013, Hong Kong, China, December 2013
Algorithms and Discrete Applied Mathematics: Proc./3rd International Conference, CALDAM 2017, Sancoale, Goa, India, February 2017
A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems
A Polynomial-Time Algorithm for Global Value Numbering
Approximating Longest Directed Paths and Cycles
Approximation Schemes Using L-Reductions1,2,3
A Strongly Polynomial Algorithm for the Transportation Problem
Average Polynomial Time Is Hard for Exponential Time Under sn-Reductions
Coloring Semi-Random Graphs in Polynomial Expected Time
Coloring Semirandom Graphs Optimally
Computer Algebra in Scientific Computing: Proc./13th International Workshop, CASC 2011, Kassel, Germany, September 2011
Computer Algebra in Scientific Computing: Proc./15th International Workshop, CASC 2013, Berlin, Germany, September 2013
Computing and Combinatorics: Proc./24th International Conference, COCOON 2018, Qing Dao, hina, July 2018
Datalog Automata
Dependency Structures and Lexicalized Grammars: An Algebraic Approach
Efficient Resolution of Singularities of Plane Curves
Foundational and Practical Aspects of Resource Analysis: Revised Selected Papers/First International Workshop, FOPARA 2009, Eindhoven, The Netherlands, November 2009
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Proc./Joint International Conference, FAW-AAIM 2012, Beijing, China, May 2012
Graph Drawing and Network Visualization: Proc./26th International Symposium, GD 2018, Barcelona, Spain, September 2018
Graph Drawing and Network Visualization: Revised Selected Papers/25th International Symposium, GD 2017, Boston,MA,USA, September 2017
Implementation of a VLSI Polynominal Evaluator for Real-Time Applications
In-place Arithmetic for Polynomials over Zn
Logic Versus Approximation: Essays Dedicated to Michael M.Richter on the Occasion of his 65th Birthday
Mathematical Aspects of Computer and Information Science: Revised Selectes Papers/6th International Conference, MACIS 2015, Berlin, Germany, November 2015
Mathematical Foundations of Computer Science 2012: Proc./37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 2012
Neural Networks for Constraint Satisfaction
Notions of Average-Case Complexity for Random 3-SAT
On Polinomial Ideals, Their Complexity, and Applications
On Tractability of Disjoint AND-Decomposition of Boolen Formulas
Parameterized and Exact Computation: Revised Selected Papers/6th International Symposium, IPEC 2011, Saarbrucken, Germany, September 2011
Polynomial Algorithms for the Synthesis of Bounded Nets
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems
Simplifying Polynomial Constraints Over Integers to Make Dependence Analysis More Precise
Solving Polynomial Fixed Point Equations
Theory and Applications of Models of Computation: Proc/7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 2010
Theory and Applications of Satisfiability Testing - SAT 2010: Proc./13th International Conference, SAT 2010, Edinburg, UK, July 2010
The Parallel Complexity of Simple Logic Programs
WALCOM: Algorithms and Computation: Proc./5th International Workshop, WALCOM 2011, New Delhi, India, February 2011
Алгоритмические вопросы конъюнктивной декомпозиции булевых формул
Компьютерно-алгебраические методы решения систем линейных обыкновенных уравнений, основанные на индуцированных рекурренциях
Метод распознавания символов, основанный на полиномиальной регрессии
Нелинейные инварианты линейных циклов и собственные полиномы линейных операторов
Полиномиальные представления и замкнутые классы функций к-значной логики
Роль избыточных ограничений в улучшении двойственных оценок для полиномиальных оптимизационных задач
Усиление теорем о полиномиальных запросах