LorePath
  • Browse
  • ·FAQ
Back to Results

Magical Tome

Cover of Introduction to Circuit Complexity
First published
1999
Publisher
Springer
Pages
270 pages
ISBN
9783540643104

Introduction to Circuit Complexity

The outer archives are busy

by Heribert Vollmer

About this book

Suppose we are given two binary strings, each consisting of n bits, a = an-an-2 . . . a0, and b = bn-1bn-2 . . . b0.

Match Score

Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.

Create free account

Marks of the Realm

Marks left by readers of this tome

No community marks yet — be the first to inscribe this tome.

Pacing

—out of 5

Horror / Dark Elements

—out of 5

Romance

—out of 5

Spice Level

—out of 5

LGBTQ+ Representation

—out of 5

Social & Political Themes in Stories

—out of 5

Inscribe Your Rating

Mark this tome across each content category