Boolean Function Complexity

Boolean Function Complexity

eBook - 1992
Rate this:
Cambridge Univ Pr
Boolean function complexity has seen exciting advances in the past few years. It is a long established area of discrete mathematics that uses combinatorial and occasionally algebraic methods. Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The list of participants includes very well known figures in the field, and the topics covered will be significant to many mathematicians and computer scientists working in related areas.
Here Professor Paterson brings together papers from the 1990 Durham symposium on Boolean function complexity. The participants include many well known figures in the field.

Publisher: Cambridge ; New York, NY, USA : Cambridge University Press, 1992
ISBN: 9780511526633
0511526636
9781107361720
1107361729
9780521408264
0521408261
Characteristics: 1 online resource (201 pages) : illustrations
Additional Contributors: Paterson, Michael S.

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at WPL

  Loading...
[]
[]
To Top