Snark (graph theory)

Known as: Snark, Snark theorem 
In the mathematical field of graph theory, a snark is a simple, connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Cloud database systems such as Amazon RDS or Google Cloud SQLenable the outsourcing of a large database to a server who then… (More)
Is this relevant?
2016
2016
In this work we study the feasibility of knowledge extraction for succinct non-interactive arguments of knowledge (SNARKs) in a… (More)
Is this relevant?
2016
2016
Since the invention of the camera, photos have been used to document reality and to supply proof of events. Yet today it is easy… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptographic primitive, both in… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2013
Highly Cited
2013
An argument system for NP is a proof system that allows efficient verification of NP statements, given proofs produced by an… (More)
  • figure 1-1
  • figure 3-2
  • figure 3-3
  • figure 4-1
  • figure 4-2
Is this relevant?
2013
2013
For many of the unsolved problems concerning cycles and matchings in graphs it is known that it is su cient to prove them for… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Succinct non-interactive arguments of knowledge (SNARKs) enable verifying NP statements with complexity that is essentially… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Tangibles, in the form of physical artefacts that are electronically augmented and enhanced to trigger various digital events to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
  • 1984
 
Is this relevant?