Cargando…
Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size [Formula: see text] bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation so...
Autores principales: | Baghery, Karim, González, Alonso, Pindado, Zaira, Ràfols, Carla |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7334997/ http://dx.doi.org/10.1007/978-3-030-51938-4_2 |
Ejemplares similares
-
On the underlying assumptions of threshold Boolean networks as a model for genetic regulatory network behavior
por: Tran, Van, et al.
Publicado: (2013) -
Electronic switching circuits: Boolean algebra and mapping
por: Mandl, Matthew
Publicado: (1969) -
Ones and zeros: understanding Boolean algebra digital circuits and the logic of sets
por: Gregg, John
Publicado: (1998) -
From Boolean Network Model to Continuous Model Helps in Design of Functional Circuits
por: Shao, Bin, et al.
Publicado: (2015) -
The combination of the functionalities of feedback circuits is determinant for the attractors’ number and size in pathway-like Boolean networks
por: Azpeitia, Eugenio, et al.
Publicado: (2017)