Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821803868, 9781470433895

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Anomalous properties of Maslov’s iterative method

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/05 ◽

1996 ◽

pp. 65-74

Author(s):

I. V. Melichev

Keyword(s):

Iterative Method

Download Full-text

Semantics of S. Yu. Maslov’s iterative method

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/03 ◽

1996 ◽

pp. 23-51

Author(s):

V. Ya. Kreinovich

Keyword(s):

Iterative Method

Download Full-text

Algorithmics of 𝑁𝑃-hard problems

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/01 ◽

1996 ◽

pp. 1-4

Author(s):

R. I. Freidzon

Keyword(s):

Hard Problems

Download Full-text

Effective calculi as a technique for search reduction

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/09 ◽

1996 ◽

pp. 133-148 ◽

Cited By ~ 1

Author(s):

M. I. Kanovich

Keyword(s):

Search Reduction

Download Full-text

Dual algorithms in discrete optimization

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/07 ◽

1996 ◽

pp. 79-101 ◽

Cited By ~ 1

Author(s):

G. V. Davydov ◽

I. M. Davydova

Keyword(s):

Discrete Optimization

Download Full-text

Possible nontraditional methods of establishing unsatisfiability of propositional formulas

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/06 ◽

1996 ◽

pp. 75-77

Author(s):

Yu. V. Matiyasevich

Download Full-text

Algorithmics of propositional satisfiability problems

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/02 ◽

1996 ◽

pp. 5-22

Author(s):

E. Ya. Dantsin

Keyword(s):

Propositional Satisfiability ◽

Satisfiability Problems

Download Full-text

S. Maslov’s iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/12 ◽

1996 ◽

pp. 175-189 ◽

Cited By ~ 2

Author(s):

V. Kreinovich

Keyword(s):

Neural Networks ◽

Iterative Method ◽

Numerical Optimization ◽

Freedom Of Choice ◽

Uncertainty Reasoning

Download Full-text

On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/11 ◽

1996 ◽

pp. 161-173

Author(s):

An. A. Muchnik

Keyword(s):

Polynomial Systems ◽

Total Probability ◽

Systems Of Equations

Download Full-text

Lower bounds of combinatorial complexity for exponential search reduction

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2 ◽

10.1090/trans2/178/10 ◽

1996 ◽

pp. 149-159

Author(s):

N. K. Kossovskiĭ

Keyword(s):

Lower Bounds ◽

Combinatorial Complexity ◽

Search Reduction

Download Full-text

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Anomalous properties of Maslov’s iterative method

Semantics of S. Yu. Maslov’s iterative method

Algorithmics of 𝑁𝑃-hard problems

Effective calculi as a technique for search reduction

Dual algorithms in discrete optimization

Possible nontraditional methods of establishing unsatisfiability of propositional formulas

Algorithmics of propositional satisfiability problems

S. Maslov’s iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)

On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them

Lower bounds of combinatorial complexity for exponential search reduction

Problems of Reducing the Exhaustive Search - American Mathematical Society Translations: Series 2
Latest Publications