„Counting Complexity“

Suchergebnisse

182 Treffer

• Counting loop diagrams: computational complexity of higher-order amplitude evaluation
  Eijk, E. van ; Kleiss, R. ; Lazopoulos, A.
• Integer Representation and Counting in the Bit Probe Model
  Rahman, M. Ziaur ; Munro, J. Ian
• A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes
  Reidl, Felix ; Sullivan, Blair D.
• Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
  Bercea, Ioana O. ; Even, Guy
• Complexity of certificates, heuristics, and counting types, with applications to cryptography and circuit theory
  Rothe, Jörg
• Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
  Kowaluk, Mirosław ; Lingas, Andrzej
• Counting and enumeration complexity with application to multicriteria scheduling
  T'kindt, Vincent ; Bouibede-Hocine, Karima ; Esswein, Carl
• Counting Linear Extensions: Parameterizations by Treewidth
  Eiben, Eduard ; Ganian, R. ; Kangas, K. ; Ordyniak, S.
• Algorithms for Counting Minimum-Perimeter Lattice Animals
  Barequet, Gill ; Ben-Shachar, Gil
• Parametric Presburger arithmetic: complexity of counting and quantifier elimination
  Bogart, Tristram ; Goodrick, John ; Nguyen, Danny ; Woods, Kevin
• The complexity of counting models of linear-time temporal logic
  Torfah, Hazem ; Zimmermann, Martin
• Measuring the Formal Complexity of Architectural Curved Surfaces Based on 3D Box-Counting Dimension
  An, Weiqiang ; Wang, Chong ; Zhang, Hua ; Bi, Zhenning
• The Complexity of Counting CSP d
  Lin, Jiabao
• Pseudorandomness for Approximate Counting and Sampling
  Shaltiel, Ronen ; Umans, Christopher
• Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
  Aydınlıog̃lu, Barış ; Gutfreund, Dan ; Hitchcock, John M. ; Kawachi, Akinori
• Counting Phase Space Cells in Statistical Mechanics
  Gallavotti, Giovanni
• Finding and Counting Vertex-Colored Subtrees
  Guillemot, Sylvain ; Sikora, Florian
• A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length
  Giscard, Pierre-Louis ; Kriege, Nils ; Wilson, Richard C.
• Space-Efficient Counting in Graphs on Surfaces
  Braverman, Mark ; Kulkarni, Raghav ; Roy, Sambuddha
• Faster algorithms for counting subgraphs in sparse graphs
  Bressan, Marco