On algorithm complexity

This paper contains a review of the authors’ results in the theory of algorithm complexity. The results described concern methods for obtaining lower bounds (containing almost all exponential lower bounds on monotone complexity of monotone functions), synthesis of asymptotically optimal functional n...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of mathematical sciences (New York, N.Y.) Ročník 168; číslo 1; s. 89 - 122
Hlavní autoři: Kudryavtsev, V. B., Andreev, A. E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.07.2010
Springer
Témata:
Algorithms
Analysis
Mathematics
Mathematics and Statistics
Functional Network
Boolean Function
Interval Graph
Functional Element
Disjunctive Normal Form
ISSN:1072-3374, 1573-8795
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper contains a review of the authors’ results in the theory of algorithm complexity. The results described concern methods for obtaining lower bounds (containing almost all exponential lower bounds on monotone complexity of monotone functions), synthesis of asymptotically optimal functional networks, minimization of Boolean functions, and the problem of solving Boolean equations.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-010-9977-y