# Xishun Zhao

According to our database

Collaborative distances:

^{1}, Xishun Zhao authored at least 52 papers between 2000 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Pattern Recognit. Lett., 2020

Neural Comput. Appl., 2020

2019

CoRR, 2019

2018

Future Gener. Comput. Syst., 2018

Future Gener. Comput. Syst., 2018

Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin.

CoRR, 2018

2017

J. Artif. Soc. Soc. Simul., 2017

J. Inf. Secur. Appl., 2017

2016

Frontiers Comput. Sci., 2016

CoRR, 2016

2015

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses.

CoRR, 2015

2014

CoRR, 2014

CoRR, 2014

Sci. China Inf. Sci., 2014

Proceedings of the Artificial Intelligence: Methods and Applications, 2014

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013

Theor. Comput. Sci., 2013

Math. Log. Q., 2013

Minds Mach., 2013

2011

CoRR, 2011

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

J. Satisf. Boolean Model. Comput., 2010

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

Discret. Appl. Math., 2009

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Computational complexity of quantified Boolean formulas with fixed maximal deficiency.

Theor. Comput. Sci., 2008

Electron. Notes Theor. Comput. Sci., 2008

Electron. Notes Theor. Comput. Sci., 2008

2007

An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas.

J. Satisf. Boolean Model. Comput., 2007

J. Satisf. Boolean Model. Comput., 2007

J. Autom. Reason., 2007

2006

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

Ann. Math. Artif. Intell., 2005

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

J. Comput. Sci. Technol., 2004

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Proceedings of the Logic versus Approximation, 2004

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

J. Comput. Sci. Technol., 2003

Discret. Appl. Math., 2003

AI Commun., 2003

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.

Inf. Process. Lett., 2002

Fundam. Informaticae, 2002

Ann. Math. Artif. Intell., 2002

2001

Fundam. Informaticae, 2001

Fundam. Informaticae, 2001

Electron. Notes Discret. Math., 2001

2000

AI Commun., 2000