Browse "School of Computing(전산학부)" by Subject NP

Showing results 1 to 2 of 2

1
Computational Complexity of Quantum Satisfiability

Herrmann, Christian; Ziegler, Martin A., JOURNAL OF THE ACM, v.63, no.2, 2016-05

2
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation

Meer, Klaus; Ziegler, Martin, FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, v.9, no.5, pp.599 - 609, 2009-10

Discover

Type

. next

Open Access

Date issued

. next

Subject

. next

rss_1.0 rss_2.0 atom_1.0