1

In TCS, functions need to be converted into boolean circuits.

So is this Boolean circuit a combinational logic, i.e. a directed acyclic graph, satisfying the topological order?

I would appreciate your answer. Thanks!

Emison Lu
  • 112
  • 5

2 Answers2

2

A loop can be transformed into a circuit. The circuit might be bigger, but any polynomial-time program you can think of can be converted into a polynomial-size boolean circuit. Garbled circuits capture general two-party computation and is not limited to a restricted set of functions.

Geoffroy Couteau
  • 21,719
  • 2
  • 55
  • 78
1

We have to think about the cost of realizing a specific kind of circuit complexity.

We can say that a general program executing some kind of interactive command can't be converted in a feasible circuit: think about a main() { while(true) {} }.

An interesting discussion can be read here Conditional Boolean circuits

Crypto Learner
  • 648
  • 6
  • 16