Conference paper
Manifesto of edge ICT fabric
A. Manzalini, R. Minerva, et al.
ICIN 2013
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilistically in polynomial time using logarithmic number of random bits and by reading sublogarithmic number of bits from the proof. We discuss implications of this characterization; specifically, we show that approximating Clique and Independent Set, even in a very weak sense, is NP-hard.
A. Manzalini, R. Minerva, et al.
ICIN 2013
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
Aditya Malik, Nalini Ratha, et al.
CAI 2024
Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019