Result 1 to 20 of 730 total
Structure of polynomial-time approximation. (English)
Theory Comput. Syst. 50, No. 4, 641-674 (2012).
1
$2K_2$-partition of some classes of graphs. (English)
Discrete Appl. Math. 160, No. 18, 2662-2668 (2012).
2
Connecting complexity classes, weak formal theories, and propositional proof systems (invited talk). (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 9-11, electronic only (2012).
3
Lower bounds against weakly uniform circuits. (English)
Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20‒22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 408-419 (2012).
4
Computational complexity of Boolean functions. (English)
Russ. Math. Surv. 67, No. 1, 93-165 (2012); translation from Usp. Mat. Nauk 67, No. 1, 97-168 (2012).
5
A classification of 20-trinucleotide circular codes. (English)
Inf. Comput. 212, 55-63 (2012).
6
Algorithms for twisted involutions in Weyl groups. (English)
Algebra Colloq. 19, No. 2, 263-282 (2012).
7
Monotonicity constraints in characterizations of PSPACE. (English)
J. Log. Comput. 22, No. 2, 179-195 (2012).
8
Formal theories for linear algebra. (English)
Log. Methods Comput. Sci. 8, No. 1, Paper No. 25, 31 p., electronic only (2012).
9
Counting classes and the fine structure between NC$^1$ and L. (English)
Theor. Comput. Sci. 417, 36-49 (2012).
10
Algorithmics. The spirit of computing. Reprint of the Addison-Wesley 3rd ed. (2004). (English)
Berlin: Springer (ISBN 978-3-642-27265-3/hbk). xxii, 572~p. EUR~59.95/net; SFR~80.00; \sterling~53.99; \$~79.95 (2012).
11
On constraint satisfaction problems below P. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 203-217, electronic only (2011).
12
Effective Hironaka resolution and its complexity. (English)
Asian J. Math. 15, No. 2, 193-228 (2011).
13
Randomisation and derandomisation in descriptive complexity theory. (English)
Log. Methods Comput. Sci. 7, No. 3, Paper No. 14, 24 p., electronic only (2011).
14
Symmetric determinantal representation of weakly-skew circuits. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 543-554, electronic only (2011).
15
Reducible braids and Garside theory. (English)
Algebr. Geom. Topol. 11, No. 5, 2971-3010 (2011).
16
Equilibria problems on games: complexity versus succinctness. (English)
J. Comput. Syst. Sci. 77, No. 6, 1172-1197 (2011).
17
On the complexity of Szilard languages of regulated grammars. (English)
Cerone, Antonio (ed.) et al., Theoretical aspects of computing ‒ ICTAC 2011. 8th international colloquium, Johannesburg, South Africa, August 31‒September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23282-4/pbk). Lecture Notes in Computer Science 6916, 77-94 (2011).
18
Strong isomorphism reductions in complexity theory. (English)
J. Symb. Log. 76, No. 4, 1381-1402 (2011).
19
Do there exist complete sets for promise classes? (English)
Math. Log. Q. 57, No. 6, 535-550 (2011).
20
Result 1 to 20 of 730 total
Start
Contact
Print
General Help
