|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 52 occurrences of 20 keywords
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
51 | Jirí Fiala 0001, Daniël Paulusma |
The Computational Complexity of the Role Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 817-828, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
role assignment 2002 Mathematics Subject Classification: 05C15, computational complexity, 03D15, graph homomorphism |
51 | Martin Hofmann 0001 |
The Strength of Non-size-increasing Computation (Introduction and Summary). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 58-61, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
semantics AMS Classification: 03D15, 03C13, computational complexity, 68Q15, higher-order functions, finite model, 68Q55 |
22 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-Prover Interactive Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(2), pp. 273-307, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 81P68, 68Q15, 68Q10 |
22 | Alexander A. Sherstov |
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(2), pp. 219-247, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 68Q17 |
22 | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans |
On the Complexity of Succinct Zero-Sum Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 353-376, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
91A05, 68Q17, Subject classification. 68Q15, 03D15, 68Q32 |
22 | Alexander A. Sherstov |
Halfspace Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 149-178, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 68Q17, 68Q15 |
22 | Masahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki |
Does truth-table of linear norm reduce the one-query tautologies to a random oracle? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(2), pp. 159-180, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
22 | Johanna N. Y. Franklin |
Schnorr trivial reals: a construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(7-8), pp. 665-678, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification (2000) 03D15 |
22 | Pierre McKenzie, Klaus W. Wagner |
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(3), pp. 211-244, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q15, 03D15 |
22 | Emil Jerábek |
Complexity of admissible rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(2), pp. 73-92, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03B45, 03D15, 03B55 |
22 | Pascal Michel |
Computational complexity of logical theories of one successor and another unary function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(2), pp. 123-148, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03D15, 03B25, 68Q17 |
22 | Chris Pollett |
Languages to diagonalize against advice classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 341-361, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 03D15 |
22 | Michael R. Fellows, Jens Gramm, Rolf Niedermeier |
On The Parameterized Intractability Of Motif Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(2), pp. 141-167, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03D15, 68Q17, 68Q25 |
22 | Pascal Koiran |
Valiant's model and the cost of computing integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(3-4), pp. 131-146, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15, 03D15 |
22 | Michael J. Wooldridge, Paul E. Dunne |
The complexity of agent design problems: Determinism and history dependence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 45(3-4), pp. 343-371, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS subject classification 03D15 (complexity), 68T35 (artificial intelligence) |
22 | Toshio Suzuki |
Bounded truth table does not reduce the one-query tautologies to a random oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(6), pp. 751-762, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
22 | John Watrous |
On the complexity of simulating space-bounded quantum computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(1-2), pp. 48-84, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 68Q15 |
22 | Takashi Mihara, Shao Chin Sung |
Deterministic polynomial-time quantum algorithms for Simon's problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 162-175, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05 |
22 | László Babai, Thomas P. Hayes, Peter G. Kimmel |
The Cost of the Missing Bit: Communication Complexity with Help. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(4), pp. 455-488, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15 |
22 | Karl-Heinz Niggl |
The m\mu-measure as a tool for classifying computational complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 39(7), pp. 515-539, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03D15, 68Q15, 68Q42, 03D20 |
22 | Stasys Jukna |
Combinatorics of Monotone Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(1), pp. 65-85, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 03D15, 05D15, 68R05, 05C65, 05B30 |
22 | Karl-Heinz Niggl |
Subrecursive functions on partial sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(3), pp. 163-193, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20 |
22 | Marcus Schaefer 0001 |
A guided tour of minimal indices and shortest descriptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 37(8), pp. 521-548, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): 03D15, 03D35, 03D80 |
22 | Karl-Heinz Niggl |
A restricted computation model on Scott domains and its partial primitive recursive functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 37(7), pp. 443-481, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20 |
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|