Documentation

Complexity.Computability.Circuit.Boolean.Layered.PolyTime

Polynomial-time operations on layered Boolean circuits #

Node tags and binary wire indices are read from their actual encoding. Lookups use the binary index calculus, which bounds an index before converting it to unary. Invalid references retain the specified fallback without running for time proportional to the numerical index.

Main results #

Node evaluation is polynomial in the encoded input, including invalid binary wire indices.

Evaluate a computed layer, preserving the raw bit-string output encoding.

Free output selection is polynomial even for malformed binary indices.

Read the last layer's length, or retain the computed input width for an empty schedule.