More Efficient Match-Making and Satisfiability The Five Card Trick

Recommendations

On the Asymptotic Solution of a Card-Matching Problem
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Exact algorithms for exact satisfiability and number of perfect matchings
scientific article; zbMATH DE number 515941
Efficient SAT-based encodings of conditional cardinality constraints
Cardinal: a finite sets constraint solver
The Complexity of Rationalizing Matchings
scientific article; zbMATH DE number 5691235
A Truthful Cardinal Mechanism for One-Sided Matching

Cited in

(47)

Secure multiparty computations without computers
Card-based protocols using unequal division shuffles
Card-based cryptographic protocols for three-input functions using private operations
A secure three-input and protocol with a standard deck of minimal cards
Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
Card-based cryptographic protocols with a standard deck of cards using private operations
Efficient private PEZ protocols for symmetric functions
Card-based protocols for secure ranking computations
A single shuffle is enough for secure card-based computation of any Boolean circuit
Efficient generation of a card-based uniformly distributed random derangement
Practical card-based implementations of Yao's millionaire protocol
A card-minimal three-input and protocol using two shuffles
Efficient card-based protocols for generating a hidden random permutation without fixed points
Card-based protocols using triangle cards
scientific article; zbMATH DE number 883899 (Why is no real title available?)
Securely computing the \(n\)-variable equality function with \(2n\) cards
Computations with a deck of cards
Card-based protocols for securely computing the conjunction of multiple variables
Multi-party computation based on physical coins
Physical ZKP protocols for Nurimisaki and Kurodoko
Card-minimal protocols for symmetric Boolean functions of more than seven inputs
Hide a liar: card-based ZKP protocol for Usowan
Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
Actively revealing card attack on card-based protocols
Single-shuffle card-based protocol with eight cards per gate
Card-based ZKP protocol for Nurimisaki
Another use of the five-card trick: card-minimal secure three-input majority function evaluation
Secure computations through checking suits of playing cards
Card-Based Secure Sorting Protocol
Threshold secret sharing with geometric algebras
Card-based protocol against actively revealing card attack
Single-shuffle card-based protocols with six cards per gate
A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT
The landscape of computing symmetric n-variable functions with 2n cards
Efficient AND protocols resistant to maliciously revealing a single card
Cyclic equalizability of words and its application to card-based cryptography
Visualizing differentially private mechanisms with physical cards
Card-based protocols with single-card encoding
How to play Old Maid with virtual players
How to play Old Maid with virtual players
Card-based cryptography meets 3D printer
Card-based overwriting protocol for equality function and applications
Barrington plays cards: the complexity of card-based protocols
The landscape of optimal card-based protocols
Card-based protocols imply PSM protocols
How to play Mastermind without game master
How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition

This page was built for publication: More Efficient Match-Making and Satisfiability The Five Card Trick

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110898)