Intractability results in predicate detection

DOI10.1016/j.ipl.2005.02.008zbMath1182.68016OpenAlexW2035975494MaRDI QIDQ1041768

Sujatha Kashyap, Vijay K. Garg

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.008

zbMATH Keywords

computational complexitydistributed computingdistributed debuggingpredicate detection

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Cites Work

• NP is as easy as detecting unique solutions
• Time, clocks, and the ordering of events in a distributed system
• Unnamed Item
• Unnamed Item

This page was built for publication: Intractability results in predicate detection